Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03585687n
Noun Concept
Categories: Theoretical computer science, Trees (graph theory)
EN
lowest common ancestor  LCA  least common ancestor  least common subsumer  Nearest common ancestor
EN
In graph theory and computer science, the lowest common ancestor of two nodes v and w in a tree or directed acyclic graph T is the lowest node that has both v and w as descendants, where we define each node to be a descendant of itself. Wikipedia
Definitions
Relations
Sources
EN
In graph theory and computer science, the lowest common ancestor of two nodes v and w in a tree or directed acyclic graph T is the lowest node that has both v and w as descendants, where we define each node to be a descendant of itself. Wikipedia
term in computer science Wikidata
IS A
computational problem
DIFFERENT FROM
most recent common ancestor
Wikipedia
EN
lowest common ancestor
Wikidata
EN
lowest common ancestor
Wikipedia Redirections
EN
least common ancestor, least common subsumer, Lowest Common Ancestor, Nearest common ancestor
Wikidata Alias
EN
LCA

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License