Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02890405n
Noun Concept
NL
No term available
EN
In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a given node at a given distance from the root of the tree. Wikipedia
Relations
Sources
IS A
stelling
PART OF
grafentheorie

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