Engineering the LOUDS Succinct Tree Representation

DOI10.1007/11764298_12MaRDI QIDQ5307540zbMATH OpenOpenAlexFDO

Authors O'Neil Delpratt, Naila Rahman, Rajeev Raman

Publication date 14 September 2007

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.4250

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Succinct Trees in Practice
• Succinct ordinal trees with level-ancestor queries
• Succinct ordinal trees with level-ancestor queries
• Succinct Ordinal Trees Based on Tree Covering
• Succinct ordinal trees based on tree covering

Cited in

(10)

• Optimal indexes for sparse bit vectors
• Faster entropy-bounded compressed suffix trees
• Adaptive succinctness
• Dualities in tree representations
• GLOUDS: representing tree-like graphs
• Representation of ordered trees with a given degree distribution
• Succinct representations of ordinal trees
• Fully functional static and dynamic succinct trees
• Succinct ordinal trees with level-ancestor queries
• Succinct data structure for dynamic trees with faster queries

This page was built for publication: Engineering the LOUDS Succinct Tree Representation

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