A minimum spanning tree algorithm with inverse-Ackermann type complexity
Top Cited Papers
- 1 November 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (6) , 1028-1047
- https://doi.org/10.1145/355541.355562
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The soft heapJournal of the ACM, 2000
- A simpler minimum spanning tree verification algorithmAlgorithmica, 1997
- A randomized linear-time algorithm to find minimum spanning treesJournal of the ACM, 1995
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsJournal of Computer and System Sciences, 1994
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear TimeSIAM Journal on Computing, 1992
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINEInternational Journal of Computational Geometry & Applications, 1991
- 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
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976