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)
Published in
Space-Efficient Data StructuresPublisher
Springer Berlin Heidelbergissn
0302-9743;978-3-642-40273-9eissn
1611-3349isbn
978-3-642-40272-2Copyright date
2013Available date
2014-10-28Publisher DOI
Publisher version
http://link.springer.com/chapter/10.1007/978-3-642-40273-9_20Book series
Lecture Notes in Computer Science;8066Language
enAdministrator link
Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC