Paper Info
Title
Reachability in K_{3, 3}-free Graphs and K_5-free Graphs is in Unambiguous Log-Space
Year
Venue
Keywords
2009
Electronic Colloquium on Computational Complexity (ECCC)
planar graph,directed graph
Field
DocType
Volume
Graph,Discrete mathematics,Combinatorics,Reachability,Mathematics
Journal
16
Citations 
PageRank 
References 
2
0.39
0
Authors
2
Name
Order
Citations
PageRank
Fabian Wagner1203.87
Thomas Thierauf228833.59