Succinct representation of labeled trees
Data Structures and Algorithms
2013-12-23 v1
Abstract
We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for storing the tree. This improves the representation of He et al. which is succinct unless the entropy of the labels is small.
Keywords
Cite
@article{arxiv.1312.6039,
title = {Succinct representation of labeled trees},
author = {Dekel Tsur},
journal= {arXiv preprint arXiv:1312.6039},
year = {2013}
}