Succinct ordinal trees with level-ancestor queries
From MaRDI portal
Publication:2944527
DOI10.1145/1198513.1198516zbMath1321.68223OpenAlexW2061916218MaRDI QIDQ2944527
Venkatesh Raman, Richard F. Geary, Rajeev Raman
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1198513.1198516
Related Items (31)
Succinct indices for path minimum, with applications ⋮ Longest common extensions in trees ⋮ Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing ⋮ Representation of ordered trees with a given degree distribution ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ The function-inversion problem: barriers and opportunities ⋮ Longest Common Extensions in Trees ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Encoding range minima and range top-2 queries ⋮ Ultra-succinct representation of ordered trees with applications ⋮ A Uniform Approach Towards Succinct Representation of Trees ⋮ Succinct data structures for nearest colored node in a tree ⋮ Succinct representations of permutations and functions ⋮ Unnamed Item ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ Recent Developments in Floorplan Representations ⋮ Optimal indexes for sparse bit vectors ⋮ Succinct representation of labeled trees ⋮ A framework for succinct labeled ordinal trees over large alphabets ⋮ Path queries on functions ⋮ A Compact Encoding of Unordered Binary Trees ⋮ Simple and efficient fully-functional succinct trees ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Succinct representations of planar maps ⋮ Combined data structure for previous- and next-smaller-values ⋮ Succinct representation of dynamic trees ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Unnamed Item ⋮ BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION ⋮ Succinct Representations of Ordinal Trees ⋮ Succinct dynamic cardinal trees
This page was built for publication: Succinct ordinal trees with level-ancestor queries
