A Parallelization of Dijkstra's Shortest Path Algorithm (1998)
Cached
Download Links
- [www.mpi-sb.mpg.de]
- [www.zb.mpi-sb.mpg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. 23RD MFCS'98, LECTURE NOTES IN COMPUTER SCIENCE |
| Citations: | 20 - 6 self |
BibTeX
@INPROCEEDINGS{Crauser98aparallelization,
author = {A. Crauser and K. Mehlhorn and U. Meyer and P. Sanders},
title = {A Parallelization of Dijkstra's Shortest Path Algorithm},
booktitle = {IN PROC. 23RD MFCS'98, LECTURE NOTES IN COMPUTER SCIENCE},
year = {1998},
pages = {722--731},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel. We give a PRAM algorithm based on these criteria and analyze its performance on random digraphs with random edge weights uniformly distributed in [0, 1]. We use
