Universal Succinct Representations of Trees?

DOI10.1007/978-3-642-02927-1_38zbMath1248.68168OpenAlexW1597468572MaRDI 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

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (14)

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 ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Unnamed Item ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ m-Bonsai: A Practical Compact Dynamic Trie ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ A framework for succinct labeled ordinal trees over large alphabets ⋮ Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Unnamed Item ⋮ Succinct Representations of Ordinal Trees ⋮ Succinct dynamic cardinal trees

This page was built for publication: Universal Succinct Representations of Trees?