Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR09-049 | 5th May 2009 00:00

A log-space algorithm for reachability in planar DAGs with few sources


Authors: Derrick Stolee, Chris Bourke, N. V. Vinodchandran
Publication: 5th June 2009 01:54
Downloads: 3675


Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem is equivalent to the NL vs L problem. For planar graphs, the question is not settled. Showing that the planar reachability problem is NL-complete would show that nondeterministic log-space computations can be made unambiguous. On the other hand, very little is known about classes of planar graphs that admit log-space algorithms. We make progress in this direction. We show that reachability in planar DAGs with O(log n) number of sources can be solved in log-space. We use a new decomposition technique for planar DAGs as a basis for our algorithm.

ISSN 1433-8092 | Imprint