A computational study of efficient shortest path algorithms
- 1 January 1988
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 15 (6) , 567-576
- https://doi.org/10.1016/0305-0548(88)90052-4
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Network generation using the prufer codeComputers & Operations Research, 1986
- New Polynomial Shortest Path Algorithms and Their Computational AttributesManagement Science, 1985
- Shortest‐path methods: Complexity, interrelations and new propositionsNetworks, 1984
- Computational study of an improved shortest path algorithmNetworks, 1984
- A shortest augmenting path method for solving minimal perfect matching problemsNetworks, 1981
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Technical Note—Shortest-Path Algorithms: A ComparisonOperations Research, 1976
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959