Offline algorithms for dynamic minimum spanning tree problems
- 22 November 2005
- book chapter
- Published by Springer Nature
- p. 392-399
- https://doi.org/10.1007/bfb0028278
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975