Fast Algorithms for Finding Nearest Common Ancestors
Open Access
- 1 May 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (2), 338-355
- https://doi.org/10.1137/0213024
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Storage Modification MachinesSIAM Journal on Computing, 1980
- An Efficient Method for Storing Ancestor Information in TreesSIAM Journal on Computing, 1979
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- On Finding Lowest Common Ancestors in TreesSIAM Journal on Computing, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975