Shortest‐path methods: Complexity, interrelations and new propositions
- 1 June 1984
- Vol. 14 (2) , 257-267
- https://doi.org/10.1002/net.3230140206
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Algorithm 562: Shortest Path Lengths [H]ACM Transactions on Mathematical Software, 1980
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Improved shortest path algorithms for transport networksTransportation Research, 1978
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- A Note on Dijkstra's Shortest Path AlgorithmJournal of the ACM, 1973
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- Revised Matrix Algorithms for Shortest PathsSIAM Journal on Applied Mathematics, 1967
- AlgorithmsCommunications of the ACM, 1964
- A Theorem on Boolean MatricesJournal of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959