A linear time algorithm for the lowest common ancestors problem

Authors:
Dov Harel
Affiliations:
-
Venue:
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Year:
1980

Citing 0
Cited 2

Finding Lowest Common Ancestors in Parallel

IEEE Transactions on Computers
Labeling schemes with queries

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate two lowest common ancestor (LCA) problems on trees. We give a linear time algorithm for the off-line problem, on a random access machine (RAM). The half-line problem is one in which LCA queries on a fixed tree are arriving on line. We extend our RAM algorithm to answer each individual query in 0(1) time, with 0(n) preprocessing time. Tarjan observed that this result helps to explicate the difference in power between RAM and pointer machines. We also show how to modify our algorithm to achieve a linear preprocessing time, optimal query time, algorithm on a reference machine.