trees-survey.pdf (477.54 kB)
Succinct representations of ordinal trees
conference contribution
posted on 2014-10-28, 10:33 authored by Rajeev Raman, S. Srinivasa RaoWe survey succinct representations of ordinal, or rooted, ordered trees. Succinct representations use space that is close to the appropriate information-theoretic minimum, but support operations on the tree rapidly, usually in O(1) time.
History
Citation
Space-Efficient Data Structures, Streams, and Algorithms, Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday, 2013, 8066 , pp. 319-332Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer ScienceVersion
- AM (Accepted Manuscript)
