Succinct ordinal trees with level-ancestor queries (2004)
by
Richard F. Geary
,
Rajeev Raman
| Venue: | In SODA ’04: Proceedings of the Fifteenth annual ACM-SIAM Symposium on Discrete Algorithms |
| Citations: | 32 - 2 self |
BibTeX
@INPROCEEDINGS{Geary04succinctordinal,
author = {Richard F. Geary and Rajeev Raman},
title = {Succinct ordinal trees with level-ancestor queries},
booktitle = {In SODA ’04: Proceedings of the Fifteenth annual ACM-SIAM Symposium on Discrete Algorithms},
year = {2004},
pages = {1--10}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider succinct or space-efficient representations of trees that efficiently support a variety of navigation operations. We focus on static ordinal trees, i.e., arbitrary static rooted trees where the children of each node are ordered. The set of operations is essentially the union of the sets of operations supported by previous succinct
