Space efficient algorithms for directed series-parallel graphs

Journal of Algorithms

Volumn 60, Issue 2, 2006, Pages 85-114

  Jakoby, Andreas ^a   Liśkiewicz, Maciej ^a   Reischuk, Rüdiger ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Algorithmic graph theory; Computational complexity; Efficient algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; MOTION PLANNING; PROBLEM SOLVING;

ALGORITHMIC GRAPH THEORY; DIRECTED GRAPHS; EFFICIENT ALGORITHMS;

PARALLEL ALGORITHMS;

EID: 33745186934     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.06.010     Document Type: Article

References (18)

1. Aleliunas R., Karp R., Lipton R., Lovasz L., and Rackoff C. Random walks, universal sequences and the complexity of maze problems. Proc. 20th FOCS (1979) 218-223
2. Álvarez C., and Jenner B. A very hard log-space counting classes. Theoret. Comput. Sci. 107 (1993) 3-30
3. Allender E., and Mahajan M. The complexity of planarity testing. Proc. 17th STACS. Lecture Notes in Comput. Sci. vol. 1770 (2000) 87-98
4. Ben-Or M., and Cleve R. Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21 (1992) 54-58
5. Bodlaender H., and de Fluiter B. Parallel algorithms for series parallel graphs. Proc. 4th ESA. Lecture Notes in Comput. Sci. vol. 1136 (1996) 277-289
6. Brandstädt A., Bang Le V., and Spinrad J. Graph classes: A survey (1999), SIAM
7. Buss S., Cook S., Gupta A., and Ramachandran V. An optimal parallel algorithm for formula evaluation. SIAM J. Comput. 21 (1992) 755-780
8. 1. Theoret. Inform. Appl. 35 (2001) 259-275
9. Cook S., and McKenzie P. Problems complete for deterministic logarithmic space. J. Algorithms 8 (1987) 385-394
10. Duffin R. Topology of series-parallel networks. J. Math. Anal. Appl. 10 (1965) 303-318
11. Eppstein D. Parallel recognition of series-parallel graphs. Inform. and Comput. 98 (1992) 41-55
12. 0. Proc. 28th ICALP. Lecture Notes in Comput. Sci. vol. 2076 (2001) 104-114
13. He X., and Yesha Y. Parallel recognition and decomposition of two terminal series parallel graphs. Inform. and Comput. 75 (1987) 15-38
14. Jakoby A., and Liśkiewicz M. Paths problems in symmetric logarithmic space. Proc. 29th ICALP. Lecture Notes in Comput. Sci. vol. 2380 (2002) 269-280
15. 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
16. Karp R., and Ramachandran V. Parallel algorithms for shared-memory machines. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, vol. A (1990) 869-941
17. Tamassia R., and Vitter J.S. Parallel transitive closure and point location in planar structures. SIAM J. Comput. 20 (1991) 708-725
18. Valdes J., Tarjan R., and Lawlers E. The recognition of series parallel digraphs. SIAM J. Comput. 11 (1982) 298-313