Succinct ordinal trees with level-ancestor queries
From MaRDI portal
Publication:2944527
DOI10.1145/1198513.1198516zbMath1321.68223MaRDI 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
Unnamed Item, Recent Developments in Floorplan Representations, Unnamed Item, Succinct dynamic cardinal trees, Longest common extensions in trees, Ultra-succinct representation of ordered trees with applications, Succinct representations of permutations and functions, Optimal indexes for sparse bit vectors, Succinct representation of labeled trees, A framework for succinct labeled ordinal trees over large alphabets, Simple and efficient fully-functional succinct trees, Shortcutting directed and undirected networks with a degree constraint, Combined data structure for previous- and next-smaller-values, Succinct representation of dynamic trees, Succinct representations of planar maps, Succinct data structures for nearest colored node in a tree, Path queries on functions, The function-inversion problem: barriers and opportunities, Succinct indices for path minimum, with applications, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, Succinct data structure for dynamic trees with faster queries, A uniform paradigm to succinctly encode various families of trees, Representation of ordered trees with a given degree distribution, Fully Functional Static and Dynamic Succinct Trees, BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION, Succinct Representations of Ordinal Trees, Longest Common Extensions in Trees, Encoding range minima and range top-2 queries, A Compact Encoding of Unordered Binary Trees, Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing, A Uniform Approach Towards Succinct Representation of Trees
