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

@article{Chaudhuri1998ShortestPI,
  title={Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms},
  author={Shiva Chaudhuri and Christos D. Zaroliagis},
  journal={Theor. Comput. Sci.},
  year={1998},
  volume={203},
  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 e ciently answered We give parallel algorithms for the EREWPRAMmodel 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 n time and O n work where n is the inverse of… CONTINUE READING