You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
|
---|---|
Chapter number | 5 |
Book title |
Mathematical Foundations of Computer Science 2014
|
Published by |
Springer, Berlin, Heidelberg, August 2014
|
DOI | 10.1007/978-3-662-44465-8_5 |
Book ISBNs |
978-3-66-244464-1, 978-3-66-244465-8
|
Authors |
Tetsuo Asano, David Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe, Asano, Tetsuo, Kirkpatrick, David, Nakagawa, Kotaro, Watanabe, Osamu |