Paper Info
Title
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.
Year
Venue
Field
2014
MFCS
Discrete mathematics,Combinatorics,Computer science,Directed graph,Reachability,Planar,Time complexity
DocType
Citations 
PageRank 
Conference
7
0.51
References 
Authors
0
4
Name
Order
Citations
PageRank
Tetsuo Asano11448229.35
David G. Kirkpatrick22394541.05
Kotaro Nakagawa392.26
Osamu Watanabe471.86