Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms

We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efficiently answered. We give parallel algorithms for the EREW PRAM model of computation that depend on the treewidth of the input graph. When the treewidth is a constant, our algorithms can answer distance queries in O(α(n)) time using a single processor, after a preprocessing of O(log 2 n) time and O(n) work, where α(n) is the inverse of Ackermann's function. The class of constant treewidth graphs contains outerplanar graphs and series-parallel graphs, among others. To the best of our knowledge, these are the first parallel algorithms which achieve these bounds for any class of graphs except trees. We also give a dynamic algorithm which, after a change in an edge weight, updates our data structures in O(log n) time using O(n β ) work, for any constant 0<β< I. Moreover, we give an algorithm of independent interest: computing a shortest path tree, or finding a negative cycle in O(log 2 n) time using O(n) work.

[1]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[2]  Noga Alon,et al.  OPTIMAL PREPROCESSING FOR S ANSWERING ON-LINE PRODUCT QUERIE , 1987 .

[3]  Christos D. Zaroliagis,et al.  Shortest Path Queries in Digraphs of Small Treewidth , 1995, ICALP.

[4]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[5]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[6]  Grammati E. Pantziou,et al.  On-line and Dynamic Algorithms for Shorted Path Problems , 1995, STACS.

[7]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[8]  Edith Cohen Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition , 1996, J. Algorithms.

[9]  W. Ackermann Zum Hilbertschen Aufbau der reellen Zahlen , 1928 .

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

[11]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[12]  Edith Cohen Efficient parallel shortest-paths in digraphs with a separator decomposition , 1993, SPAA '93.

[13]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

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

[15]  Torben Hagerup,et al.  Parallel Algorithms with Optimal Speedup for Bounded Treewidth , 1995, ICALP.

[16]  Paul G. Spirakis,et al.  Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem , 1994, ISAAC.

[17]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[18]  Philip N. Klein,et al.  A linear-processor polylog-time algorithm for shortest paths in planar graphs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[19]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[20]  Yijie Han,et al.  Efficient parallel algorithms for computing all pair shortest paths in directed graphs , 1992, SPAA '92.