Abstract
This paper studies space complexity of some basic problems for undirected graphs. In particular, the two disjoint paths problem (TPP) is investigated that asks whether for a given undirected graph G and nodes s 1, s 2, t 1, t 2, G admits two node disjoint paths connecting s 1 with t 1 and s 2 with t 2. The solving of this problem belongs to the fundamental tasks of routing algorithms and VLSI design, where two pairs of nodes have to be connected via disjoint paths in a given network. One of the most important results of this paper says that TPP can be solved by a symmetric nondeterministic Turing machine that works in logarithmic space. It is well known that switching from undirected to directed graphs, TPP becomes intractable.
Furthermore, the space complexity of minor detections is discussed. We show that testing for K 4 -minor can be reduced (via log-space many-one reduction) to planarity testing and that detecting K 5-minor is hard for \( \mathcal{S}\mathcal{L} \) . As a corollary we obtain that series-parallel graphs can be recognised in \( \mathcal{S}\mathcal{L} \) . Finally, the problem to determine the number of self avoiding walks in undirected series-parallel graphs is considered. It is proved that this problem can be solved in \( \mathcal{F}\mathcal{L}^{\left\langle {\mathcal{S}\mathcal{L}} \right\rangle } \) .
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, C. Rackoff, Random Walks, Universal Sequences and the Complexity of Maze Problems, FOCS, 1979, 218–223.
E. Allender, M. Mahajan, The Complexity of Planarity Testing, STACS, 2000, 87–98.
Y. Ben-Asher, K.-J. Lange, D. Peleg, and A. Schuster, The Complexity of Reconfiguring Network Models, Inf. & Comp. 121, 1995, 41–58.
M. Ben-Or, R. Cleve Computing Algebraic Formulas Using a Constant Number of Registers, SIAM J. Comput. 21, 1992, 54–58.
H. Bodlaender, B. de Fluiter, Parallel Algorithms for Series Parallel Graphs, ESA, 1996, 277–289.
S. Buss, S. Cook, A. Gupta, V. Ramachandran, An Optimal Parallel Algorithm for Formula Evaluation, SIAM J. Comput. 21, 1992, 755–780.
A. Chiu, G. Davida, B. Litow, Division in logspace-uniform NC1, Theoretical Informatics and Applications, 35, 2001, 259–275.
S. Cook, Towards a complexity theory of synchronous parallel computation, L’Enseignement Mathematique, XXVIII, 1981, 99–124.
R. Duffin, Topology of Series-Parallel Networks, J. Math. Analysis Appl. 10, 1965, 303–318.
D. Eppstein, Parallel Recognition of Series-Parallel Graphs, Inf. & Comp. 98, 1992, 41–55.
S. Fortune, J. Hopcroft and J. Wyllie, The directed subgraph homomorphism problem, Theoretical Computer Science 10, 1980, 111–121.
X. He, Y. Yesha, Parallel Recognition and Decomposition of Two Terminal Series Parallel Graphs, Inf. & Comp. 75, 1987, 15–38.
B. Jenner, K.-J. Lange, P. McKenzie, Tree Isomorphism and Some Other Complete Problems for Deterministic Logspace, publication #1059, DIRO, Université de Montréal, 1997.
A. Jakoby, M. Liśkiewicz, R. Reischuk, Space Efficient Algorithms for Series-Parallel Graphs STACS, 2001, 339–352. See also ECCC Report TR02-021, 2002.
R. Karp, On the complexity of the combinatorial problems, Networks 5, 1975, 45–48.
A. Kézdy and P. McGuinness, Sequential and Parallel Algorithms to Find a K5 Minor, SODA, 1992, 345–356.
M. Liśkiewicz, M. Ogihara, and S. Toda, The Complexity of Counting Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs, ECCC Report TR01-061, 2001.
H. R. Lewis and C. H. Papadimitriou, Symmetric space-bounded computations, Theoretical Computer Science 19, 1982, 161–187.
N. Nisan and A. Ta-Shma, Symmetric logspace is closed under complement, FoCS, 1995, 140–146.
J. Reif, Symmetric Complementation, Journal of the ACM, vol. 31(2), 1984, 401–421.
N. Robertson, P. D. Seymour, Graph Minors XIII. The Disjoint Paths Problems, J. of Combinatorial Theory, Series B 63, 1995, 65–110.
N. Robertson, P. D. Seymour, R. Thomas, Non-Planar Extensions Of Planar Graphs, http://www.math.gatech.edu/~thomas/ext.ps
P. D. Seymour, Disjoint paths in Graphs, Discrete Math. 29, 1980, 293–309.
Y Shiloach, A Polynomial Solution to the Undirected Two Paths Problem, J. of the ACM, Vol. 27, 1980, 445–456.
R. Thomas, Graph Planarity and Related Topics, Graph Drawing, 1999, 137–144.
C. Thomassen, 2-linked Graphs, Europ. J. Combinatorics 1, 1980, 371–378.
G. Woeginger, A simple solution to the two paths problem in planar graphs, Inform. Process. Lett. 36, 1990, No. 4, 191–192.
J. Valdes, R. Tarjan, E. Lawlers The Recognition of Series Parallel Digraphs, SIAM J. Comput. 11, 1982, 298–313.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakoby, A., Liskiewicz, M. (2002). Paths Problems in Symmetric Logarithmic Space. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive