The Directed Planar Reachability Problem

We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is logspace-reducible to its complement, and we show that the problem of searching graphs of genus 1 reduces to the planar case. We also consider a previously-studied subclass of planar graphs known as grid graphs. We show that the directed planar s-t-connectivity problem reduces to the reachability problem for directed grid graphs. A special case of the grid-graph reachability problem where no edges are directed from right to left is known as the “layered grid graph reachability problem”. We show that this problem lies in the complexity class UL.

[1]  Eric Allender,et al.  Grid graph reachability problems , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[2]  Carsten Thomassen,et al.  Embeddings of graphs with no short noncontractible cycles , 1990, J. Comb. Theory, Ser. B.

[3]  Meena Mahajan,et al.  The complexity of planarity testing , 2000, Inf. Comput..

[4]  M.M. Halldorsson,et al.  Directed vs. undirected monotone contact networks for threshold functions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[5]  Samuel R. Buss,et al.  On Truth-Table Reducibility to SAT , 1991, Inf. Comput..

[6]  Kousha Etessami,et al.  Counting quantifiers, successor relations, and logarithmic space , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[7]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[8]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[9]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[10]  Peter Bro Miltersen,et al.  Searching constant width mazes captures the AC 0 hierarchy , 1997 .

[11]  Andreas Jakoby,et al.  Space Efficient Algorithms for Series-Parallel Graphs , 2001, STACS.

[12]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[13]  Noam Nisan,et al.  Symmetric logspace is closed under complement , 1995, STOC '95.

[14]  Meena Mahajan,et al.  A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) , 2000, STOC '00.

[15]  Peter Bro Miltersen,et al.  Searching Constant Width Mazes Captures the AC0 Hierarchy , 1997, STACS.

[16]  Róbert Szelepcsényi,et al.  The method of forced enumeration for nondeterministic automata , 1988, Acta Informatica.

[17]  Eric Allender,et al.  Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..

[18]  Klaus-Jörn Lange.  An Unambiguous Class Possessing a Complete Set , 1997, STACS.

[19]  Eric Allender,et al.  Making nondeterminism unambiguous , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[20]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[21]  Edith Hemaspaandra,et al.  The relative power of logspace and polynomial time reductions , 2005, computational complexity.

[22]  Nancy A. Lynch,et al.  Relativization of questions about log space computability , 1976, Mathematical systems theory.