An Improved Succinct Representation for Dynamic k-ary Trees

DOI10.1007/978-3-540-69068-9_26MaRDI QIDQ3506960zbMATH OpenOpenAlexFDO

Authors Diego Arroyuelo

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_26

Mathematics Subject Classification ID

Data structures (68P05) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Succinct dynamic cardinal trees with constant time operations for small alphabet
• Succinct dynamic cardinal trees
• Fully-functional succinct trees
• Fully functional static and dynamic succinct trees
• Representing dynamic binary trees succinctly

Cited in

(14)

• New dynamic construction techniques for M-tree
• Linked dynamic tries with applications to LZ-compression in sublinear time and space
• A succinct data structure for self-indexing ternary relations
• Succinct data structure for dynamic trees with faster queries
• Succinct dynamic cardinal trees
• A practical succinct dynamic graph representation
• Fully functional static and dynamic succinct trees
• Succinct dynamic cardinal trees with constant time operations for small alphabet
• A Uniform Approach Towards Succinct Representation of Trees
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
• Succinct representation of dynamic trees
• Space-efficient construction of Lempel-Ziv compressed text indexes
• Faster dynamic compressed \(d\)-ary relations
• Dynamic extended suffix arrays

This page was built for publication: An Improved Succinct Representation for Dynamic k-ary Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506960)