Engineering the LOUDS Succinct Tree Representation
From MaRDI portal
Publication:5307540
DOI10.1007/11764298_12zbMath1196.68058OpenAlexW1554285337MaRDI QIDQ5307540
Rajeev Raman, Naila Rahman, O'Neil Delpratt
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
Related Items (8)
Representation of ordered trees with a given degree distribution ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Optimal indexes for sparse bit vectors ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Unnamed Item ⋮ Faster entropy-bounded compressed suffix trees ⋮ Succinct Representations of Ordinal Trees ⋮ Adaptive succinctness
This page was built for publication: Engineering the LOUDS Succinct Tree Representation
