bn:02890405n
Noun Concept
Categories: Theoretical computer science, Trees (graph theory)
EN
level ancestor problem
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
Definitions
Relations
Sources
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
A mathematical graph theory problem Wikidata
IS A
PART OF
Wikipedia
Wikipedia Redirections