Improved shortest path algorithms for transport networks
- 28 February 1978
- journal article
- Published by Elsevier in Transportation Research
- Vol. 12 (1) , 7-20
- https://doi.org/10.1016/0041-1647(78)90102-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Technical Note—Shortest-Path Algorithms: A ComparisonOperations Research, 1976
- A Shortest Path Algorithm for Edge-Sparse GraphsJournal of the ACM, 1976
- Implementation and efficiency of Moore-algorithms for the shortest route problemMathematical Programming, 1974
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$SIAM Journal on Computing, 1973
- Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½
N
3
Additions and
N
3
ComparisonsJournal of the ACM, 1972
- Die Bestimmung kürzester Pfade in Graphen und passende DatenstrukturenComputing, 1971
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- AlgorithmsCommunications of the ACM, 1964
- On finding minimum routes in a network with turn penaltiesCommunications of the ACM, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959