Finding the k smallest spanning trees
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Finding k points with minimum diameter and related problemsJournal of Algorithms, 1991
- Parallel computational geometryAlgorithmica, 1988
- Planar point location using persistent search treesCommunications of the ACM, 1986
- 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
- An Algorithm for Finding K Minimum Spanning TreesSIAM Journal on Computing, 1981
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973