Shortest path methods: A unifying approach
- 1 January 1986
- book chapter
- other
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problemPublished by Springer Science and Business Media LLC ,2005
- Remark on algorithm 562ACM Transactions on Mathematical Software, 1983
- A dual simplex algorithm for finding all shortest pathsNetworks, 1981
- A note on finding shortest path treesNetworks, 1981
- A note on the problem of updating shortest pathsNetworks, 1981
- Algorithm 562: Shortest Path Lengths [H]ACM Transactions on Mathematical Software, 1980
- Reoptimization procedures in shortest path problemDecisions in Economics and Finance, 1980
- Improved shortest path algorithms for transport networksTransportation Research, 1978
- AlgorithmsCommunications of the ACM, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959