A new algorithm to find the shortest paths between all pairs of nodes
- 31 January 1982
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 4 (1) , 23-35
- https://doi.org/10.1016/0166-218x(82)90031-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Technical Note—Shortest-Path Algorithms: A ComparisonOperations Research, 1976
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- A Dual Shortest Path AlgorithmSIAM Journal on Applied Mathematics, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959