Finding least common ancestors in directed acyclic graphs

@inproceedings{Bender2001FindingLC,
  title={Finding least common ancestors in directed acyclic graphs},
  author={Michael A. Bender and Giridhar Pemmasani and Steven Skiena and Pavel Sumazin},
  booktitle={SODA},
  year={2001}
}
One of the fundamental algorithmic problems on trees is how to find the least common ancestor (LCA) of a given pair of nodes. The LCA of nodes u and v in a tree is an ancestor of u and v that is located farthest from the root. The LCA problem is stated as follows: Given a rooted tree T, how can we preprocess T to answer LCA queries quickly on any pair of nodes? The LCA problem has been studied intensively both because it is inherently beautiful and because fast algorithms for the LCA problem… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Discrete range searching primitive for the GPU and its applications

ACM Journal of Experimental Algorithmics • 2012
View 8 Excerpts
Highly Influenced

Efficient Discrete Range Searching primitives on the GPU with applications

2010 International Conference on High Performance Computing • 2010
View 7 Excerpts
Highly Influenced

Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Electronic Colloquium on Computational Complexity • 2006
View 9 Excerpts
Highly Influenced

LCA Queries in Directed Acyclic Graphs

View 10 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…