# Item

ITEM ACTIONSEXPORT

Released

Report

#### Shortest paths in digraphs of small treewidth part II: optimal parallel algirithms

##### External Resource

No external resources are shared

##### Fulltext (restricted access)

There are currently no full texts shared for your IP range.

##### Fulltext (public)

MPI-I-95-1-021.pdf

(Any fulltext), 237KB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Chaudhuri, S., & Zaroliagis, C.(1995). *Shortest paths in
digraphs of small treewidth part II: optimal parallel algirithms* (MPI-I-1995-1-021). Saarbrücken: Max-Planck-Institut
für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-A41F-5

##### Abstract

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 {\em treewidth} of
the input graph. When the treewidth is a constant, our algorithms
can answer distance queries in $O(\alpha(n))$ time using a single
processor, after a preprocessing of $O(\log^2n)$ time and $O(n)$ work,
where $\alpha(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^\beta)$ work, for any constant $0 < \beta < 1$.
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.