Succinct representation of labeled trees
From MaRDI portal
Publication:476876
DOI10.1016/j.tcs.2014.10.006zbMath1303.68043arXiv1312.6039OpenAlexW2053769163MaRDI QIDQ476876
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.6039
Related Items (7)
Representation of ordered trees with a given degree distribution ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Succinct data structures for nearest colored node in a tree ⋮ A framework for succinct labeled ordinal trees over large alphabets ⋮ Path queries on functions ⋮ Unnamed Item ⋮ Tree path majority data structures
Cites Work
- Succinct representations of permutations and functions
- Representing trees of higher degree
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- New Lower and Upper Bounds for Representing Sequences
- Succinct ordinal trees with level-ancestor queries
- Compressing and indexing labeled trees, with applications
- A Uniform Approach Towards Succinct Representation of Trees
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
- Orderly Spanning Trees with Applications
This page was built for publication: Succinct representation of labeled trees
