Δ-Stepping : A Parallel Single Source Shortest Path Algorithm
Authors:
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 393-404
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Efficient Parallel Shortest-Paths in Digraphs with a Separator DecompositionJournal of Algorithms, 1996
- Randomized parallel algorithms1996
- Polylog-time and near-linear work approximation scheme for undirected shortest paths1994
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs1992
- Greedy partitioned algorithms for the shortest-path problemInternational Journal of Parallel Programming, 1991
- Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computationCommunications of the ACM, 1988
- On Shortest Paths in Graphs with Random WeightsMathematics of Operations Research, 1985
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985
- Distributed computation on graphsCommunications of the ACM, 1982
- A note on two problems in connexion with graphsNumerische Mathematik, 1959