An Optimal Minimum Spanning Tree Algorithm
- 1 January 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A faster deterministic algorithm for minimum spanning treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Car-Pooling as a Data Structuring Device: The Soft HeapPublished by Springer Nature ,1998
- A randomized linear-time algorithm to find minimum spanning treesJournal of the ACM, 1995
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear TimeSIAM Journal on Computing, 1992
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- Linear expected-time algorithms for connectivity problemsJournal of Algorithms, 1980
- A note on two problems in connexion with graphsNumerische Mathematik, 1959