Paths problems in symmetric logarithmic space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 269-280

  Jakoby, Andreas ^a   Liśkiewicz, MacIej ^a,b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; GRAPHIC METHODS; TURING MACHINES;

DISJOINT PATHS; DISJOINT PATHS PROBLEM; NODE-DISJOINT PATHS; SELF AVOIDING WALK; SERIES-PARALLEL GRAPH; SPACE COMPLEXITY; UNDIRECTED GRAPH; VLSI DESIGN;

DIRECTED GRAPHS;

EID: 33745206183     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_24     Document Type: Conference Paper

References (29)

1. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, C. Rackoff, RandomWalks, Universal Sequences and the Complexity of Maze Problems, FOCS, 1979, 218-223.
2. E. Allender, M. Mahajan, The Complexity of Planarity Testing, STACS, 2000, 87-98.
3. Y. Ben-Asher, K.-J. Lange, D. Peleg, and A. Schuster, The Complexity of Reconfiguring Network Models, Inf. & Comp. 121, 1995, 41-58.
4. M. Ben-Or, R. Cleve Computing Algebraic Formulas Using a Constant Number of Registers, SIAM J. Comput. 21, 1992, 54-58.
5. H. Bodlaender, B. de Fluiter, Parallel Algorithms for Series Parallel Graphs, ESA, 1996, 277-289.
6. S. Buss, S. Cook, A. Gupta, V. Ramachandran, An Optimal Parallel Algorithm for Formula Evaluation, SIAM J. Comput. 21, 1992, 755-780.
7. A. Chiu, G. Davida, B. Litow, Division in logspace-uniform NC1, Theoretical Informatics and Applications, 35, 2001, 259-275.
8. S. Cook, Towards a complexity theory of synchronous parallel computation, L'Enseignement Mathematique, XXVIII, 1981, 99-124.
9. R. Duffin, Topology of Series-Parallel Networks, J. Math. Analysis Appl. 10, 1965, 303-318.
10. D. Eppstein, Parallel Recognition of Series-Parallel Graphs, Inf. & Comp. 98, 1992, 41-55.
11. S. Fortune, J. Hopcroft and J.Wyllie, The directed subgraph homomorphism problem, Theoretical Computer Science 10, 1980, 111-121.
12. X. He, Y. Yesha, Parallel Recognition and Decomposition of Two Terminal Series Parallel Graphs, Inf. & Comp. 75, 1987, 15-38.
13. 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.
14. A. Jakoby, M. Liśkiewicz, R. Reischuk, Space Efficient Algorithms for Series-Parallel Graphs STACS, 2001, 339-352.
15. See also ECCC Report TR02-021, 2002.
16. R. Karp, On the complexity of the combinatorial problems, Networks 5, 1975, 45-48.
17. 5 Minor,SODA, 1992, 345-356.
18. M. Liśkiewicz, M. Ogihara, and S. Toda, The Complexity of Counting Self-AvoidingWalks in Two-Dimensional Grid Graphs and in Hypercube Graphs, ECCC Report TR01-061, 2001.
19. H. R. Lewis and C. H. Papadimitriou, Symmetric space-bounded computations, Theoretical Computer Science 19, 1982, 161-187.
20. N. Nisan and A. Ta-Shma, Symmetric logspace is closed under complement, FoCS, 1995, 140-146.
21. J. Reif, Symmetric Complementation, Journal of the ACM, vol. 31(2), 1984, 401-421.
22. N. Robertson, P. D. Seymour, Graph Minors XIII. The Disjoint Paths Problems, J. of Combinatorial Theory, Series B 63, 1995, 65-110.
23. N. Robertson, P. D. Seymour, R. Thomas, Non-Planar Extensions Of Planar Graphs, http://www.math.gatech.edu/~thomas/ext.ps
24. P. D. Seymour, Disjoint paths in Graphs, Discrete Math. 29, 1980, 293-309.
25. Y. Shiloach, A Polynomial Solution to the Undirected Two Paths Problem, J. of theACM,Vol. 27, 1980, 445-456.
26. R. Thomas, Graph Planarity and Related Topics, Graph Drawing, 1999, 137-144.
27. C. Thomassen, 2-linked Graphs, Europ. J. Combinatorics 1, 1980, 371-378.
28. G.Woeginger, A simple solution to the two paths problem in planar graphs, Inform. Process. Lett. 36, 1990, No. 4, 191-192.
29. J.Valdes, R.Tarjan, E. Lawlers The Recognition of Series Parallel Digraphs,SIAMJ. Comput. 11, 1982, 298-313.