Abstract
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism. As our main result, we show a new upper bound on the directed planar reachability problem by showing that it can be decided in the class unambiguous logarithmic space (UL). We explore the possibility of showing the same upper bound for the general graph reachability problem. We give a simple reduction showing that the reachability problem for directed graphs with thickness two is complete for the class nondeterministic logarithmic space (NL). Hence an extension of our results to directed graphs with thickness two will unconditionally collapse NL to UL.
- Allender, E., Barrington, D. A. M., Chakraborty, T., Datta, S., and Roy, S. 2006. Grid graph reachability problems. In Proceedings of the Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA. 299--313. Google Scholar
Digital Library
- Allender, E., Datta, S., and Roy, S. 2005. The directed planar reachability problem. In Proceedings of the 25th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag, Berlin, Germany. Google Scholar
Digital Library
- Allender, E. and Lange, K.-J. 1998. RUSPACE(logn) ⊆ DSPACE (log2
n/loglogn). Theory of Computing Systems 31, 539--550. (Special issue devoted to the 7th Annual International Symposium on Algorithms and Computation (ISAAC’96).)Google Scholar
Cross Ref
- Allender, E. and Mahajan, M. 2004. The complexity of planarity testing. Inf. Comput. 189, 117--134. Google Scholar
Digital Library
- Allender, E., Reinhardt, K., and Zhou, S. 1999. Isolation, matching, and counting: Uniform and nonuniform upper bounds. J. Comput. Syst. Sci. 59, 164--181. Google Scholar
Digital Library
- Àlvarez, C. and Jenner, B. 1993. A very hard log-space counting class. Theoret. Comput. Sci. 107, 3--30. Google Scholar
Digital Library
- Barrington, D. A. M. 1989. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 150--164. Google Scholar
Digital Library
- Barrington, D. A. M., Lu, C.-J., Miltersen, P. B., and Skyum, S. 1998. Searching constant width mazes captures the AC0 hierarchy. In Proceedings of the 15th International Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 1373. Springer-Verlag, Berlin, Germany. 74--83. Google Scholar
Digital Library
- Blum, M. and Kozen, D. 1978. On the power of the compass (or, why mazes are easier to search than graphs). In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA. 132--142. Google Scholar
Digital Library
- Buntrock, G., Jenner, B., Lange, K.-J., and Rossmanith, P. 1991. Unambiguity and fewness for logarithmic space. In Proceedings of the 8th International Conference on Fundamentals of Computation Theory (FCT’91). Lecture Notes in Computer Science, vol. 529. Springer-Verlag, Berlin, Germany. 168--179. Google Scholar
Digital Library
- Datta, S., Kulkarni, R., Limaye, N., and Mahajan, M. 2007. Planarity, determinants, permanents, and (unique) perfect matchings. In Proceedings of 2nd International Computer Science Symposium in Russia CSR. Lecture Notes in Computer Science, vol. 4649. Springer-Verlag, New York. 115--126. Google Scholar
Digital Library
- Datta, S., Kulkarni, R., and Roy, S. 2008. Deterministically isolating a perfect matching in bipartite planar graphs. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science. pp. 229--240, www.stacs-conf.org.Google Scholar
- Dillencourt, M. B., Eppstein, D., and Hirschberg, D. S. 2000. Geometric thickness of complete graphs. J. Graph Algor. Appl. 4, 3, 5--17.Google Scholar
Cross Ref
- Etessami, K. 1997. Counting quantifiers, successor relations, and logarithmic space. J. Comput. Syst. Sci. 54, 3 (June), 400--411. Google Scholar
Digital Library
- Gibbons, A. 1985. Algorithmic Graph Theory. Cambridge University Press, Cambridge, UK.Google Scholar
- Grollman, J. and Selman, A. L. 1988. Complexity measures for public-key cryptosystems. SIAM J. Comput. 17, 309--335. Google Scholar
Digital Library
- Hutchinson, J. P., Shermer, T. C., and Vince, A. 1995. On representations of some thickness-two graphs. In GD’95: Proceedings of the Symposium on Graph Drawing. Springer-Verlag, Berlin, Germany. 324--332. Google Scholar
Digital Library
- Immerman, N. 1988. Nondeterministic space is closed under complement. SIAM J. Comput. 17, 935--938. Google Scholar
Digital Library
- Lange, K.-J. 1997. An unambiguous class possessing a complete set. In Proceedings of the 14th International Symposium on Theoretical Aspects of Computer Science (STACS). Springer-Verlag, Berlin, Germany. 339--350. Google Scholar
Digital Library
- Limaye, N., Mahajan, M., and Nimbhorkar, P. 2009. Longest path in planar DAGs in unambiguous logspace. In Proceedings of the Australasian Theory Symposium (ATS), to appear. Google Scholar
Digital Library
- Mulmuley, K., Vazirani, U., and Vazirani, V. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 105--113. Google Scholar
Digital Library
- Reingold, O. 2005. Undirected st-connectivity in log-space. In STOC’05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. IEEE Computer Society Press, Los Alamitos, CA. 376--385. Google Scholar
Digital Library
- Reinhardt, K. and Allender, E. 2000. Making nondeterminism unambiguous. SIAM J. Comput. 29, 1118--1131. (An earlier version appeared in FOCS 1997, pp. 244--253). Google Scholar
Digital Library
- Szelepcsényi, R. 1988. The method of forced enumeration for nondeterministic automata. Acta Inf. 26, 279--284. Google Scholar
Digital Library
- Thierauf, T. and Wagner, F. 2008. The isomorphism problem for planar 3-connected graphs is in unambiguous logspace. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, pp. 633--644, www.stacs-conf.org.Google Scholar
- Valiant, L. 1976. The relative complexity of checking and evaluating. Inf. Proc. Lett. 5, 20--23.Google Scholar
Cross Ref
Index Terms
Directed Planar Reachability Is in Unambiguous Log-Space
Recommendations
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
Directed reachability (or briefly reachability) is the following decision problem: given a directed graph G and two of its vertices s,t, determine whether there is a directed path from s to t in G. Directed reachability is a standard complete problem ...
Planar and Grid Graph Reachability Problems
Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea SorbiWe study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for $\mathsf{NL}$. In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main ...
Planar Graph Isomorphism is in Log-Space
CCC '09: Proceedings of the 2009 24th Annual IEEE Conference on Computational ComplexityGraph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant gap between extant lower and upper bounds for planar graphs as well. We ...






Comments