Dynamic Succinct Ordered Trees

DOI10.1007/978-3-642-02927-1_37MaRDI QIDQ3638054zbMATH OpenOpenAlexFDO

Authors Arash Farzan, J. Ian Munro

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_37

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Succinct representation of dynamic trees
• Fully-functional succinct trees
• Fully functional static and dynamic succinct trees
• Representing dynamic binary trees succinctly
• Ultra-succinct representation of ordered trees

Cited in

(8)

• Succinct data structure for dynamic trees with faster queries
• A uniform paradigm to succinctly encode various families of trees
• Representing dynamic binary trees succinctly
• Fully functional static and dynamic succinct trees
• The Property Suffix Tree with Dynamic Properties
• Succinct representation of dynamic trees
• Fully-functional succinct trees
• Dynamic compact planar embeddings

This page was built for publication: Dynamic Succinct Ordered Trees

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