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.
Review
2016
Review
2016
Comprehensive Study on Keyword Search on Semi Structured Data
Keyword search is a user-friendly approach that enables inexperienced users to easily retrieve information from XML data with no… 
2013
2013
Back-Track Routing for Fat-Tree Based Data Center Networks
Fat-tree topology is very popular for constructing interconnect network for data centers. Routing is one of the most important… 
2010
2010
A New Measure Based on Gene Ontology for Semantic Similarity of Genes
In this paper, we propose a novel method to measure the semantic similarity between genes. The key principle of our method relies… 
2008
2008
All-pairs disjoint paths from a common ancestor in O~(ninfinit) time
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… 
2007
2007
A Calculation Mechanism for Similarity Measure with Clustering an Unbalanced Hierarchical Terminology Structure
The effective retrieval of reverent information often is quite useful to the user, for example, to query the respectful knowledge… 
2006
2006
A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees
A simple and general method for computing location codes of same-size neighboring nodes for any direction within quadtrees is… 
2005
2005
Siamese-twin: a dynamically fault-tolerant fat-tree
Fat-trees are a special case of multistage interconnection networks with quite good static fault tolerance capabilities. They are… 
2004
2004
Sonic - Non-standard Inferences Go OilEd
Sonic is the first prototype implementation of non-standard inferences for Description Logics usable via a graphical user… 
1996
1996
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
We consider the problem of finding the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a dynamic… 
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)