On Finding Lowest Common Ancestors: Simplification and Parallelization
SIAM Journal on Computing1988Vol. 17(6), pp. 1253–1262
Citations Over TimeTop 1% of 1988 papers
Abstract
We consider the following problem. Suppose a rooted tree T is available for preprocessing. Answer on-line queries requesting the lowest common ancestor for any pair of vertices in T. We present a linear time and space preprocessing algorithm that enables us to answer each query in $O(1)$ time, as in Harel and Tarjan [SIAM J. Comput., 13 (1984), pp. 338–355]. Our algorithm has the advantage of being simple and easily parallelizable. The resulting parallel preprocessing algorithm runs in logarithmic time using an optimal number of processors on an EREW PRAM. Each query is then answered in $O(1)$ time using a single processor.
Related Papers
- Synthesis of Parallel Algorithms(1993)
- → Orthogonal range searching in linear and almost-linear space(2008)56 cited
- → A Fast Parallel Algorithm for the Poisson Equation on a Disk(2001)37 cited
- → Orthogonal Range Searching in Linear and Almost-Linear Space(2007)6 cited
- → A Linear Space Data Structure for Range LCP Queries*(2018)5 cited