Representation of ordered trees with a given degree distribution
From MaRDI portal
Publication:2656174
DOI10.1016/j.jcss.2020.12.002zbMath1487.68086arXiv1807.00371OpenAlexW3120266648MaRDI QIDQ2656174
Publication date: 10 March 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.00371
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct dynamic cardinal trees
- Ultra-succinct representation of ordered trees with applications
- Succinct representations of permutations and functions
- Succinct representation of labeled trees
- Combined data structure for previous- and next-smaller-values
- Succinct representation of dynamic trees
- Representing trees of higher degree
- A simple optimal representation for balanced parentheses
- Succinct data structure for dynamic trees with faster queries
- A uniform paradigm to succinctly encode various families of trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Succinct ordinal trees with level-ancestor queries
- Succinct ordinal trees based on tree covering
- On the Size of Succinct Indices
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Engineering the LOUDS Succinct Tree Representation
- A Framework for Dynamizing Succinct Data Structures
This page was built for publication: Representation of ordered trees with a given degree distribution
