Abstract
There has been a great deal of progress in the fifteen years that have elapsed since Wigderson published his survey on the complexity of the graph connectivity problem [Wig92]. Most significantly, Reingold solved the longstanding question of the complexity of the s-t connectivity problem in undirected graphs, showing that this is complete for logspace (L) [Rei05].
This survey talk will focus on some of the remaining open questions dealing with graph reachability problems. Particular attention will be paid to these topics:
-
Reachability in planar directed graphs (and more generally, in graphs of low genus) [ADR05, BTV07].
-
Reachability in different classes of grid graphs [ABC + 06].
-
Reachability in mangroves [AL98].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allender, E., Mix Barrington, D., Chakraborty, T., Datta, S., Roy, S.: Grid graph reachability problems. In: IEEE Conference on Computational Complexity, pp. 299–313. IEEE Computer Society Press, Los Alamitos (2006)
Allender, E., Datta, S., Roy, S.: The directed planar reachability problem. In: Proc. 25th annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS). LNCS, vol. 1373, pp. 238–249. Springer, Heidelberg (2005)
Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theoretical Computer Science 107, 3–30 (1993)
Allender, E., Lange, K.-J.: RUSPACE(logn) is contained in DSPACE(log2 n / loglogn). Theory of Computing Systems 31, 539–550 (1998)
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)
Buntrock, G., Jenner, B., Lange, K.-J., Rossmanith, P.: Unambiguity and fewness for logarithmic space. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 168–179. Springer, Heidelberg (1991)
Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous logspace. In: IEEE Conference on Computational Complexity (to appear, IEEE Computer Society Press, Los Alamitos (2007)
Jones, N.D.: Space bounded reducibility among combinatorial problems. Journal of Computer and System Sciences 11, 68–85 (1975)
Lange, K.-J.: An unambiguous class possessing a complete set. In: 14th International Symposium on Theoretical Aspects of Computer Science (STACS). LNCS, vol. 1200, pp. 339–350. Springer, Heidelberg (1997)
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, Washington, DC, USA (2005)
Wigderson, A.: The complexity of graph connectivity. In: Havel, I.M., Koubek, V. (eds.) Symposium on Mathematical Foundations of Computer Science. LNCS, vol. 629, pp. 112–132. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allender, E. (2007). Reachability Problems: An Update. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)