On Finding and Updating Spanning Trees and Shortest Paths
- 1 September 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (3) , 375-380
- https://doi.org/10.1137/0204032
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- 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
- Proving simultaneous positivity of linear formsJournal of Computer and System Sciences, 1972
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957