(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.

Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe

Browse the full MFCS paper archive.