Skip to search formSkip to main contentSkip to account menu

Lowest common ancestor

Known as: Least common ancestor, Least common subsumer, Nearest common ancestor 
In graph theory and computer science, the lowest common ancestor (LCA) of two nodes v and w in a tree or directed acyclic graph (DAG) T is the lowest… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
ACM Transactions on Programming Languages and SystemsCartesian treeCographComplex system

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
SplayNet: Towards Locally Self-Adjusting Networks
This paper initiates the study of locally self-adjusting networks: networks whose topology adapts dynamically and in a… 
2007
2007
Fast Lowest Common Ancestor Computations in Dags
This work studies lowest common ancestor computations in directed acyclic graphs. We present fast algorithms for solving the ALL… 
Highly Cited
2004
Highly Cited
2004
Schema-Free XQuery
Review
2004
Review
2004
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
Several papers describe linear time algorithms to preprocess a tree, in order to answer subsequent nearest common ancestor… 
Highly Cited
2004
Highly Cited
2004
Optimizing taxonomic semantic web queries using labeling schemes
Highly Cited
2002
Highly Cited
2002
Homology and the origin of correspondence
Homology is a natural kind term and a precise account of what homologyis has to come out of theories about the role of homologues… 
2000
2000
Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis
Given a finite set \(\mathcal{C} := \{ C_1, \ldots, C_n\}\) of description logic concepts, we are interested in computing the… 
Highly Cited
2000
Highly Cited
2000
Informative labeling schemes for graphs
1980
1980
A linear time algorithm for the lowest common ancestors problem
  • D. Harel
  • 21st Annual Symposium on Foundations of Computer…
  • 1980
  • Corpus ID: 160877
We investigate two lowest common ancestor (LCA) problems on trees. We give a linear time algorithm for the off-line problem, on a… 
Highly Cited
1973
Highly Cited
1973
On finding lowest common ancestors in trees
Trees in an n node forest are to be merged according to instructions in a given sequence, while other instructions in the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)