MPI-I-94-112. April 1994, 14 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
We describe algorithms for finding shortest paths and distances in a
planar digraph which exploit the particular topology of the input graph.
We give both sequential and parallel algorithms that
work on a dynamic environment, where the cost of any edge
can be changed or the edge can be deleted.
For outerplanar digraphs, for instance, the data
structures can be updated after any such change in only $O(\log n)$
time, where $n$ is the number of vertices of the digraph.
The parallel algorithms presented here are the first known ones
for solving this problem. Our results can be extended to hold for
digraphs of genus $o(n)$.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|MPI-I-94-112.pdf||73 KBytes; 125 KBytes|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|