Algorithms for updating minimal spanning trees
- 1 June 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 16 (3), 333-344
- https://doi.org/10.1016/0022-0000(78)90022-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959