research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Article
Entered by:
TitleShortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithmsShortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
Bibtex cite IDRACTI-RU1-1998-5
Journal Journal of Algorithms
Year published 1998
Volume 203
Number 2
Pages 205-223
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(log2n) 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 < â < 1. Moreover, we give an algorithm of independent interest: computing a shortest path tree, or finding a negative cycle in O(log2n) time using O(n) work.
Shiva, Chaudhuri
Zaroliagis, Christos
shortest paths.pdf (main file)
Publication ID857