Succinct representation of labeled trees

Research output: Contribution to journalArticlepeer-review

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. (ISAAC 2012) [8] which is succinct only when the entropy of the labels is ω(1).

Original languageAmerican English
Pages (from-to)320-329
Number of pages10
JournalTheoretical Computer Science
Volume562
Issue numberC
DOIs
StatePublished - 1 Jan 2015

Keywords

  • Labeled trees
  • Succinct data-structures

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Succinct representation of labeled trees'. Together they form a unique fingerprint.

Cite this