Space Efficient Algorithms for Series-Parallel Graphs

The subclass of directed series-parallel graphs plays an important role in computer science. To determine whether a graph is series-parallel is a well studied problem in algorithmic graph theory. Fast sequential and parallel algorithms for this problem have been developed in a sequence of papers. For series-parallel graphs methods are also known to solve the reachability and the decomposition problem time efficiently. However, no dedicated results have been obtained for the space complexity of these problems - the topic of this paper. For this special class of graphs, we develop deterministic algorithms for the recognition, reachability, decomposition and the path counting problem that use only logarithmic space. Since for arbitrary directed graphs reachability and path counting are believed not to be solvable in log-space the main contribution of this work are novel deterministic path finding routines that work correctly in series-parallel graphs, and a characterisation of series-parallel graphs by forbidden subgraphs that can be tested space-efficiently. The space bounds are best possible, i.e. the decision problems is shown to be L-complete with respect to AC°-reductions, and they have also implications for the parallel time complexity of series-parallel graphs. Finally, we sketch how these results can be generalised to extension of the series-parallel graph family: to graphs with multiple sources or multiple sinks and to the class of minimal vertex series-parallel graphs.

[1]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[2]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  Stephen A. Cook,et al.  Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.

[4]  Eugene L. Lawler,et al.  The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[5]  Carme Àlvarez,et al.  A Very Hard log-Space Counting Class , 1993, Theor. Comput. Sci..

[6]  Hans L. Bodlaender,et al.  Parallel Algorithms for Series Parallel Graphs , 1996, ESA.

[7]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[8]  S. Finch.  Series-Parallel Networks , 2003 .

[9]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10]  Samuel R. Buss,et al.  An Optimal Parallel Algorithm for Formula Evaluation , 1992, SIAM J. Comput..

[11]  Michael Ben-Or,et al.  Computing Algebraic Formulas Using a Constant Number of Registers , 1992, SIAM J. Comput..

[12]  Meena Mahajan,et al.  The complexity of planarity testing , 2000, Inf. Comput..

[13]  David Eppstein,et al.  Parallel Recognition of Series-Parallel Graphs , 1992, Inf. Comput..

[14]  R. Duffin.  Topology of series-parallel networks , 1965 .