Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allender, E., Mahajan, M.: The complexity of planarity testing. Information and Computation 189, 117–134 (2004)
Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: Uniform and nonuniform upper bounds. Journal of Computer and System Sciences 59(2), 164–181 (1999)
Barrington, D.A.M.: Grid graph reachability problems. Talk presented at Dagstuhl Seminar on Complexity of Boolean Functions, Seminar number 02121 (2002)
Buss, S.R., Hay, L.: On truth-table reducibility to SAT. Inf. Comput. 91(1), 86–102 (1991)
Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 132–142 (1978)
Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: Searching constant width mazes captures the AC0 hierarchy. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 73–83. Springer, Heidelberg (1998)
Buhrman, H., Spaan, E., Torenvliet, L.: The relative power of logspace and polynomial time reductions. Computational Complexity 3, 231–244 (1993)
Etessami, K.: Counting quantifiers, successor relations, and logarithmic space. Journal of Computer and System Sciences 54(3), 400–411 (1997)
Gross, J., Tucker, T.: Topological Graph Theory, 1st edn. John Wiley and Sons, Chichester (1987)
Immerman, N.: Nondeterministic space is closed under complementation. SIAM Journal on Computing 17, 935–938 (1988)
Jakoby, A., Liskiewicz, M., Reischuk, R.: Space efficient algorithms for seriesparalle graphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 339–352. Springer, Heidelberg (2001) (to appear in J. Algorithms)
Lange, K.-J.: An unambiguous class possessing a complete set. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 339–350. Springer, Heidelberg (1997)
Ladner, R., Lynch, N.: Relativization of questions about log space reducibility. Mathematical Systems Theory 10, 19–32 (1976)
Mohar, B., Thomassen, C.: Graphs on surfaces, 1st edn. John Hopkins University Press, Maryland (2001)
Mahajan, M., Varadarajan, K.R.: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs. In: ACM Symposium on Theory of Computing (STOC), pp. 351–357 (2000)
Nisan, N., Ta-Shma, A.: Symmetric Logspace is closed under complement. Chicago Journal of Theoretical Computer Science (1995)
Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. SIAM Journal of Computing 29, 1118–1131 (2000)
Reingold, O.: Undirected st-connectivity in log-space. In: Proceedings 37th Symposium on Foundations of Computer Science, pp. 376–385. IEEE Computer Society Press, Los Alamitos (2005)
Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata. Acta Informatica 26, 279–284 (1988)
Thomassen, C.: Embeddings of graphs with no short noncontractible cycles. J. Comb. Theory Ser. B 48(2), 155–177 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allender, E., Datta, S., Roy, S. (2005). The Directed Planar Reachability Problem. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_19
Download citation
DOI: https://doi.org/10.1007/11590156_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30495-1
Online ISBN: 978-3-540-32419-5
eBook Packages: Computer ScienceComputer Science (R0)