Old Web
English
Sign In
Acemap
>
Paper
>
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.
2014
Tetsuo Asano
David G. Kirkpatrick
Kotaro Nakagawa
Osamu Watanabe
Keywords:
Discrete mathematics
Directed graph
Computer science
Combinatorics
Time complexity
Reachability
Planar
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
18
Citations
NaN
KQI
[]