Marked Ancestor Problems (1998)
by
Stephen Alstrup
,
Thore Husfeldt
,
Theis Rauhe
| Citations: | 45 - 6 self |
BibTeX
@MISC{Alstrup98markedancestor,
author = {Stephen Alstrup and Thore Husfeldt and Theis Rauhe},
title = {Marked Ancestor Problems},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Consider a rooted tree whose nodes can be marked or unmarked. Given a node, we want to find its nearest marked ancestor. This generalises the well-known predecessor problem, where the tree is a path.
