Universal Succinct Representations of Trees?
From MaRDI portal
Recommendations
Cited in
(21)- 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
- Succinct dynamic cardinal trees
- Succinct representation of balanced parentheses and static trees
- Fully functional static and dynamic succinct trees
- Succinct representations of ordinal trees
- Ultra-succinct representation of ordered trees
- Succinct dynamic cardinal trees with constant time operations for small alphabet
- Succinct ordinal trees based on tree covering
- A Uniform Approach Towards Succinct Representation of Trees
- Ultra-succinct representation of ordered trees with applications
- scientific article; zbMATH DE number 1145903 (Why is no real title available?)
- Compact navigation and distance oracles for graphs with small treewidth
- A framework for succinct labeled ordinal trees over large alphabets
- Balanced parentheses strike back
- Dualities in tree representations
- m-Bonsai: a practical compact dynamic trie
- Succinct Ordinal Trees Based on Tree Covering
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
This page was built for publication: Universal Succinct Representations of Trees?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638055)