A Uniform Approach Towards Succinct Representation of Trees
From MaRDI portal
Publication:3512457
DOI10.1007/978-3-540-69903-3_17zbMath1155.68373OpenAlexW1765644073WikidataQ56032216 ScholiaQ56032216MaRDI QIDQ3512457
Publication date: 15 July 2008
Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_17
Related Items (12)
On succinct representations of binary trees ⋮ GLOUDS: representing tree-like graphs ⋮ Encoding 2D range maximum queries ⋮ Ultra-succinct representation of ordered trees with applications ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Succinct representation of labeled trees ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Combined data structure for previous- and next-smaller-values ⋮ Succinct representation of dynamic trees ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Succinct Representations of Ordinal Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representing trees of higher degree
- Catalan, Motzkin, and Riordan numbers
- Binary trees having a given number of nodes with 0, 1, and 2 children
- The number of trees
- Succinct ordinal trees with level-ancestor queries
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Succinct Ordinal Trees Based on Tree Covering
- Non-Associate Powers and a Functional Equation
This page was built for publication: A Uniform Approach Towards Succinct Representation of Trees