Partical aspect and experienceAn experimental comparison of two distributed single-source shortest path algorithms
References (28)
- et al.
Parallel synchronous and asynchronous implementations of the auction algorithm
Parallel Computing
(1991) - et al.
Derivation of a termination detection algorithm for distributed computations
Information Processing Letters
(1983) - et al.
Parallel shortest path auction algorithms
Parallel Computing
(1994) - et al.
On finding and updating shortest paths distributively
J. Algorithms
(1992) - et al.
Greedy partitioned algorithms for the shortest path problem
Int. J. Parallel Programming
(1991) - et al.
Parallel algorithms for the single-source shortest path problem
- et al.
An auction algorithm for shortest paths
SIAM J. Optimization
(1991)- et al.
Parallel asynchronous label correcting methods for shortest paths
J. Optimization Theory and Applications
(1996) - et al.
Distributed computation on graphs: Shortest path algorithms
Commun. ACM
(1982)
Shortest path algorithms: Theory and experimental evaluation
Distributed shortest path algorithms based on token passing
Developed within the Esprit P2701 PUMA project
Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation
Commun. ACM
(1988)
Cited by (20)
An innovative routing technique to optimize time and speed
2012, Procedia EngineeringParallel implementation of a transportation network model
2005, Journal of Parallel and Distributed ComputingParallel implementation of geometric shortest path algorithms
2003, Parallel ComputingΔ-stepping: A parallelizable shortest path algorithm
2003, Journal of AlgorithmsImplementing parallel shortest path for parallel transportation applications
2001, Parallel ComputingTermination Detection for Parallel Shortest Path Algorithms
1998, Journal of Parallel and Distributed Computing
- ∗
Author's current address: Max-Planck Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany.
Copyright © 1995 Published by Elsevier B.V.