A Parallelization of Dijkstra's Shortest Path Algorithm (1998)

Cached

Download Links

by A. Crauser , K. Mehlhorn , U. Meyer , P. Sanders
Venue:IN PROC. 23RD MFCS'98, LECTURE NOTES IN COMPUTER SCIENCE
Citations:26 - 6 self

Documents Related by Co-Citation

11 Parallel Shortest Path for Arbitrary Graphs – U. Meyer, P. Sanders - 2000
17 A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs – Jesper L. Träff, Christos D. Zaroliagis - 1996
1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
325 On a routing problem – R Bellman - 1958
92 Undirected single-source shortest paths with positive integer weights in linear time – M Thorup - 1999
14 Shortest Path Queries in Digraphs of Small Treewidth – S Chaudhuri, C Zaroliagis
11 Efficient Sequential and Parallel Algorithms for the Negative Cycle – D Kavvadias, G Pantziou, P Spirakis, C Zaroliagis
33 Efficient Parallel Shortest-paths in Digraphs with a Separator Decomposition – E Cohen - 1993
16 Δ -stepping: a parallelizable shortest path algorithm – U Meyer, P Sanders
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
641 An Introduction to Parallel Algorithms – J JáJá - 1992
15 A Parallel Priority Queue with Constant Time Operations – Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis - 1998
1126 A bridging model for parallel computation – Leslie G Valiant - 1990
25 Recent results on the single-source shortest paths problem – R Raman - 1997
70 On RAM priority queues – Mikkel Thorup - 1996
28 Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time – Ulrich Meyer - 2001
8 Performance Study of a Parallel Shortest Path Algorithm – Michelle Hribar, Valerie E. Taylor, David E. Boyce - 1996
21 On finding and updating shortest paths distributively – K Ramarao, S Venkatesan - 1992
25 Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs – Yijie Han, V. Y. Pan, J. H. Reif - 1997