A parallelization of Dijkstra's shortest path algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 722-731

  Crauser, A ^a   Mehlhorn, K ^a   Meyer, U ^a   Sanders, P ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIJKSTRA'S SHORTEST PATH ALGORITHM; EXTERNAL MEMORY; HIGH PROBABILITY; PARALLEL SOLUTIONS; PARALLELIZATIONS; PRAM ALGORITHMS; RANDOM EDGE WEIGHTS; SINGLE SOURCE SHORTEST PATHS; SHORTEST PATH ALGORITHMS;

GRAPH THEORY;

ALGORITHMS;

EID: 84896773698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055823     Document Type: Conference Paper

References (22)

1. N. Alon, J. H. Spencer, and P. Erdös. The Probabilistic Method. Wiley, 1992.
2. L. Arge. Efficient external-memory data structures and applications. PhD thesis, University of Aarhus, BRICS-DS-96-3, 1996.
3. G. S. Brodai, J. L. Träff, and C. D. Zaroliagis. A parallel priority queue with constant time operation. In 11th IPPS, pages 689-693. IEEE, 1997.
4. A. Clementi, L. Kucera, and J. D. P. Rolim. A randomized parallel search strategy. In A. Ferreira and J. D. P. Rolim, editors, Parallel Algorithms for Irregular Problems: State of the Art, pages 213-227. Kluwer, 1994.
5. E. Cohen. Polylog-time and near-linear work approximation scheme for undirected shortest paths. In 26th STOC, pages 16-26. ACM, 1994.
6. E. Cohen. Efficient parallel shortest-paths in digraphs with a separator decomposition. Journal of Algorithms, 21(2):331-357, 1996.
7. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. Parallelizing Dijkstra's shortest path algorithm. Technical report, MPI-Informatik, 1998. in preparation.
8. E. Dijkstra. A note on two problems in connexion with graphs. Num. Math., 1:269-271, 1959.
9. J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan. Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343-1354, 1988.
10. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math., 10:57-77, 1985.
11. Y. Han, V. Pan, and J. Reif. Efficient parallel algorithms for computing all pairs shortest paths in directed graphs. In 4th SPAA, pages 353-362. ACM, 1992.
12. R. Hassin and E. Zemel. On shortest paths in graphs with random weights. Math. Oper. Res., 10(4):557-564, 1985.
13. J. Jâjâ. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
14. R. M. Karp. The transitive closure of a random digraph. Rand. Struct. Alg., 1, 1990.
15. D. E. Knuth. The Stanford GraphBase: a platform for combinatorial computing. Addison-Wesley, New York, NY, 1993.
16. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In 8th SPDP, pages 169-177. IEEE, 1996.
17. U. Meyer and P. Sanders, δ-stepping: A parallel shortest path algorithm. In 6th ESA, LNCS. Springer, 1998.
18. G. L. Miller and J. H. Reif. Parallel tree contraction and its application. In 26th Symposium on Foundations of Computer Science, pages 478-489. IEEE, 1985.
19. P. Sanders. Randomized priority queues for fast parallel access. Journal Parallel and Distributed Computing, 49:86-97, 1998.
20. M. Thorup. Undirected single source shortest paths in linear time. In 38th Annual Symposium on Foundations of Computer Science, pages 12-21. IEEE, 1997.
21. J. L. Träff and C. D. Zaroliagis. A simple parallel algorithm for the single-source shortest path problem on planar digraphs. In Irregular'96, Volume 1117 of LNCS, pages 183-194. Springer, 1996.
22. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Technical Report CS-90-21, Brown University, 1990.