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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
*Correspondence: Marc G. Dumont, Department of Biogeochemistry, Max Planck Institute for Terrestrial Microbiology, Karl-von… (More)
  • table 1
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
In this lecture, we look at various data structures to solve problems about static trees: given a static tree, we perform some… (More)
Is this relevant?
2008
2008
Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will… (More)
Is this relevant?
2007
2007
This work studies lowest common ancestor problems in directed acyclic graphs. We present fast algorithms for solving the All… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
We present two new methods for finding a lowest common ancesto r (LCA) for each pair of vertices of a directed acyclic graph (dag… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1994
1994
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of… (More)
Is this relevant?
1994
1994
It is well known how to preprocess a rooted tree in linear time to yield the lowest common ancestor of any given pair of nodes in… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We consider the following problem: Given a collection of rooted trees, answer on-line queries of the form, "What is the nearest… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1980
1980
  • Dov Harel
  • 21st Annual Symposium on Foundations of Computer…
  • 1980
We investigate two lowest common ancestor (LCA) problems on trees. We give a linear time algorithm for the off-line problem, on a… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Trees in an n node forest are to be merged according to instructions in a given sequence, while other instructions in the… (More)
  • figure 2
  • figure 4
  • figure 5
Is this relevant?