An Algorithm for Finding K Minimum Spanning Trees
- 1 May 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (2) , 247-255
- https://doi.org/10.1137/0210017
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- 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
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path ProblemManagement Science, 1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956