Succinct representation of dynamic trees

DOI10.1016/J.TCS.2010.10.030zbMath1220.68072OpenAlexW1995186768MaRDI QIDQ541673

J. Ian Munro, Arash Farzan

Publication date: 7 June 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.030

zbMATH Keywords

ordered treessuccinct data structuresdynamic trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (10)

Representation of ordered trees with a given degree distribution ⋮ Space-efficient B trees via load-balancing ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Generation matrix: an embeddable matrix representation for hierarchical trees ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet ⋮ Unnamed Item ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Succinct Representations of Ordinal Trees ⋮ Succinct dynamic cardinal trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing trees of higher degree
• Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9--13, 2007. Proceedings.
• Succinct ordinal trees with level-ancestor queries
• Compressed indexes for dynamic text collections
• A Uniform Approach Towards Succinct Representation of Trees
• On the Size of Succinct Indices
• Optimal Lower Bounds for Rank and Select Indexes
• Algorithms and Computation
• Succinct Ordinal Trees Based on Tree Covering
• A Framework for Dynamizing Succinct Data Structures

This page was built for publication: Succinct representation of dynamic trees