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

Active Bibliography

Δ-Stepping: A Parallel Single Sourche Shortest . . . – Ulrich Meyer, Peter Sanders - 1998
Directed Single-Source Shortest-Paths in Linear Average-Case Time – Ulrich Meyer, Ulrich Meyer - 2001
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
6 Buckets strike back: Improved Parallel Shortest-Paths – Ulrich Meyer - 2002
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
11 Parallel Shortest Path for Arbitrary Graphs – U. Meyer, P. Sanders - 2000
5 A space-efficient parallel algorithm for computing betweenness centrality in distributed memory – Nick Edmonds, Torsten Hoefler, Andrew Lumsdaine - 2010
2 Average-Case Complexity of Shortest-Paths Problems – Volker Priebe, Der Naturwissenschaftlich-technischen Fakultät I, Dekan Prof, Dr. Rainer Schulze-pillot-ziemen, Gutachter Prof, Dr. Kurt Mehlhorn, Prof Alan Frieze, Ph. D
28 Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time – Ulrich Meyer - 2001
9 Parallel Shortest Path Algorithms for Solving . . . – Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak - 2006
11 An experimental study of a parallel shortest path algorithm for solving large-scale graph instances – Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak - 2007
unknown title – Ulrich Meyer - 2001
9 Bulk Synchronous Parallel Algorithms for the External Memory Model – Frank Dehne, Wolfgang Dittrich, David Hutchinson, Anil Maheshwari - 2002
15 A Parallel Priority Queue with Constant Time Operations – Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis - 1998
Probabilistic Reasoning – Joseph Gonzalez, Joseph Gonzalez - 2012
1 Efficient Parallel Algorithms for Planar st-Graphs 1 – Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu, Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu - 2002
35 Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms – Shiva Chaudhuri , Christos D. Zaroliagis - 1995
8 Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems – Dimitris Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis - 1996
4 Distributed shortest path for directed graphs with negative edge lengths – Lubos Brim, Ivana Cerna, Pavel Krical , Radek Pelanek - 2001