Δ-Stepping: A Parallel Single Sourche Shortest . . . (1998)
| Venue: | IN ESA ’98: PROCEEDINGS OF THE 6TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS |
BibTeX
@INPROCEEDINGS{Meyer98δ-stepping:a,
author = {Ulrich Meyer and Peter Sanders},
title = {Δ-Stepping: A Parallel Single Sourche Shortest . . .},
booktitle = {IN ESA ’98: PROCEEDINGS OF THE 6TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS},
year = {1998},
pages = {393--404},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In spite of intensive research, little progress has been made towards fast and work-efficient parallel algorithms for the single source shortest path problem. Our \Delta-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following "average-case" sense: For random directed graphs with edge probability n and uniformly distributed edge weights a PRAM version works in expected time O using linear work. The algorithm also allows for efficient adaptation to distributed memory machines. Implementations show that our approach works on real machines. As a side effect, we get a simple linear time sequential algorithm for a large class of not necessarily random directed graphs with random edge weights.
