A simpler minimum spanning tree verification algorithm
- 1 June 1997
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 18 (2) , 263-270
- https://doi.org/10.1007/bf02526037
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- 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
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- Linear verification for spanning treesCombinatorica, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979