Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,376,792 papers from all fields of science
Search
Sign In
Create Free Account
Level ancestor problem
In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Array data structure
Data structure
Graph theory
Jagged array
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A Simple Solution to the Level-Ancestor Problem
Gaurav Menghani
,
Dhruv Mátáni
arXiv.org
2019
Corpus ID: 67856472
A Level Ancestory query LA($u$, $d$) asks for the the ancestor of the node $u$ at a depth $d$. We present a simple solution…
Expand
2014
2014
The Level Ancestor Problem in Practice
Dimitris P. Papamichail
,
Thomas Caputi
,
Georgios P. Papamichail
arXiv.org
2014
Corpus ID: 18295438
Given a rooted tree T, the level ancestor problem is the problem of answering queries of the form LA(v, d), which identify the…
Expand
2009
2009
The Euler Path to Static Level-Ancestors
Amir M. Ben-Amram
arXiv.org
2009
Corpus ID: 578137
Suppose a rooted tree T is given for preprocessing. The level-ancestor problem is to answer quickly queries of the following form…
Expand
2003
2003
The Level-Ancestor problem on Pure Pointer Machines
D. Ranjan
,
Enrico Pontelli
Information Processing Letters
2003
Corpus ID: 8205714
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)
ACCEPT & CONTINUE