We consider succinct representations of labeled ordinal trees that support a rich set of operations. Our new representations support a much broader collection of operations than previous work [10,8,1]. In our approach, labels of nodes are stored in a preorder label sequence, which can be compressed using any succinct index for strings that supports rankα and selectα operations. In other words, we present a framework for succinct representations of labeled ordinal trees that allows alphabets to be large. This answers an open problem presented by Geary et al. [10]. We further extend our work and present the first succinct representation of dynamic labeled ordinal trees that supports several label-based operations including finding the level ancestor with a given label. © Springer-Verlag 2012.
CITATION STYLE
He, M., Munro, J. I., & Zhou, G. (2012). A framework for succinct labeled ordinal trees over large alphabets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 537–547). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_56
Mendeley helps you to discover research relevant for your work.