A new shortest path updating algorithm
- 1 December 1978
- Vol. 8 (4) , 341-372
- https://doi.org/10.1002/net.3230080406
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A two levels algorithm for tearingIEEE Transactions on Circuits and Systems, 1976
- Sparse matrix techniques for the shortest path problemIEEE Transactions on Circuits and Systems, 1976
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975
- A sparse matrix method for analysis of piecewise-linear resistive networksIEEE Transactions on Circuit Theory, 1972
- An Algebra for Network Routing ProblemsIMA Journal of Applied Mathematics, 1971
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- The parametric problem of shortest distancesUSSR Computational Mathematics and Mathematical Physics, 1968
- Triangular factors of modified matricesNumerische Mathematik, 1965
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958