Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03585687n
Noun Concept
SYL
No term available
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
Relations
Sources
IS A
EN
computational problem
DIFFERENT FROM
EN
most recent common ancestor

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