A simpler minimum spanning tree verification algorithm
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 440-448
- https://doi.org/10.1007/3-540-60220-8_83
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A randomized linear-time algorithm for finding minimum spanning treesPublished by Association for Computing Machinery (ACM) ,1994
- 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
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979