Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs

For many types of graphs, including directed acyclic graphs, undirected graphs, tournament graphs, and graphs with bounded independence number, the shortest path problem is NL-complete. The longest path problem is even NP-complete for many types of graphs, including undirected K5-minor-free graphs and planar graphs. In the present paper we present logspace algorithms for computing shortest and longest paths in series-parallel graphs where the edges can be directed arbitrarily. The class of series-parallel graphs that we study can be characterized alternatively as the class of K4-minor-free graphs and also as the class of graphs of tree-width 2. It is well-known that for graphs of bounded tree-width many intractable problems can be solved efficiently, but previous work was focused on finding algorithms with low parallel or sequential time complexity. In contrast, our results concern the space complexity of shortest and longest path problems. In particular, our results imply that for directed graphs of tree-width 2 these problems are L-complete.

[1]  Jens Lagergren,et al.  Efficient Parallel Algorithms for Graphs of Bounded Tree-Width , 1996, J. Algorithms.

[2]  Andreas Jakoby,et al.  Space efficient algorithms for directed series-parallel graphs , 2006, J. Algorithms.

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

[4]  Hans L. Bodlaender,et al.  Treewidth: Characterizations, Applications, and Computations , 2006, WG.

[5]  William Hesse.  Division Is in Uniform TC0 , 2001, ICALP.

[6]  Eric Allender,et al.  Grid graph reachability problems , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[7]  Andreas Jakoby,et al.  Space Efficient Algorithms for Series-Parallel Graphs , 2001, STACS.

[8]  Andrew Chiu,et al.  Division in logspace-uniform NC1 , 2001, RAIRO Theor. Informatics Appl..

[9]  Andreas Jakoby,et al.  Paths Problems in Symmetric Logarithmic Space , 2002, ICALP.

[10]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[11]  Xin He,et al.  Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs , 1987, Inf. Comput..

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

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

[14]  Torben Hagerup,et al.  Parallel Algorithms with Optimal Speedup for Bounded Treewidth , 1995, SIAM J. Comput..

[15]  Raghunath Tewari,et al.  Directed Planar Reachability is in Unambiguous Log-Space , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

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

[17]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

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

[19]  Hans L. Bodlaender,et al.  NC-Algorithms for Graphs with Small Treewidth , 1988, WG.

[20]  Joost Engelfriet,et al.  Domino Treewith (Extended Abstract) , 1994, WG.

[21]  Christos D. Zaroliagis,et al.  Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms , 2000, Algorithmica.

[22]  Till Tantau,et al.  The Complexity of Finding Paths in Graphs with Bounded Independence Number , 2005, SIAM J. Comput..

[23]  Christos D. Zaroliagis,et al.  Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms , 1998, Theor. Comput. Sci..

[24]  Hans L. Bodlaender,et al.  Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1 , 2001, Algorithmica.

[25]  Egon Wanke,et al.  Bounded Tree-Width and LOGCFL , 1993, J. Algorithms.