Universal Succinct Representations of Trees?
From MaRDI portal
Publication:3638055
DOI10.1007/978-3-642-02927-1_38zbMath1248.68168MaRDI QIDQ3638055
Arash Farzan, S. Srinivasa Rao, Rajeev Raman
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_38
68P05: Data structures
Related Items
Unnamed Item, m-Bonsai: A Practical Compact Dynamic Trie, Unnamed Item, Succinct dynamic cardinal trees, Ultra-succinct representation of ordered trees with applications, Compact navigation and distance oracles for graphs with small treewidth, A framework for succinct labeled ordinal trees over large alphabets, Succinct indices for path minimum, with applications, On succinct representations of binary trees, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, A uniform paradigm to succinctly encode various families of trees, Fully Functional Static and Dynamic Succinct Trees, Succinct Representations of Ordinal Trees, Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet