A note on the problem of updating shortest paths
- 1 September 1981
- Vol. 11 (3), 317-319
- https://doi.org/10.1002/net.3230110309
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A new shortest path updating algorithmNetworks, 1978
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- On some techniques useful for solution of transportation network problemsNetworks, 1971
- The parametric problem of shortest distancesUSSR Computational Mathematics and Mathematical Physics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959