On Finding Lowest Common Ancestors: Simplification and Parallelization
- 1 December 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (6), 1253-1262
- https://doi.org/10.1137/0217079
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel ear decomposition search (EDS) and st-numbering in graphsTheoretical Computer Science, 1986
- Finding Lowest Common Ancestors in ParallelIEEE Transactions on Computers, 1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- On efficient parallel strong orientationInformation Processing Letters, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984