Representing trees of higher degree
From MaRDI portal
Publication:818675
DOI10.1007/s00453-004-1146-6zbMath1086.68034MaRDI QIDQ818675
David Benoit, S. Srinivasa Rao, Venkatesh Raman, Rajeev Raman, J. Ian Munro, Erik D. Demaine
Publication date: 21 March 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1146-6
68P05: Data structures
Related Items
Unnamed Item, Engineering Practical Lempel-Ziv Tries, Recent Developments in Floorplan Representations, Optimal rank and select queries on dictionary-compressed text, Practical Compact Indexes for Top-kDocument Retrieval, m-Bonsai: A Practical Compact Dynamic Trie, Succinct Representation of Labeled Graphs, Unnamed Item, Space-efficient data structure for next/previous larger/smaller value queries, Succinct dynamic cardinal trees, Simultaneous encodings for range and next/previous larger/smaller value queries, On compressing and indexing repetitive sequences, Ultra-succinct representation of ordered trees with applications, Succinct representations of permutations and functions, Succinct representation of labeled trees, A framework for succinct labeled ordinal trees over large alphabets, Simple and efficient fully-functional succinct trees, Combined data structure for previous- and next-smaller-values, Succinct representation of dynamic trees, Space-efficient construction of Lempel-Ziv compressed text indexes, Lempel-Ziv factorization powered by space efficient suffix trees, A simple optimal representation for balanced parentheses, Encoding 2D range maximum queries, Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees, On compact representations of all-pairs-shortest-path-distance matrices, Path queries on functions, Tree compression using string grammars, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, Top tree compression of tries, Space-efficient construction of compressed suffix trees, Lempel-Ziv compressed structures for document retrieval, Tree compression with top trees, On succinct representations of binary trees, Succinct representations of weighted trees supporting path queries, Improved range minimum queries, On the succinct representation of equivalence classes, Succinct data structure for dynamic trees with faster queries, Stronger Lempel-Ziv based compressed text indexing, Succinct representation of labeled graphs, Succinct and I/O efficient data structures for traversal in trees, A uniform paradigm to succinctly encode various families of trees, Adaptive searching in succinctly encoded binary relations and tree-structured documents, Rank and select revisited and extended, GLOUDS: representing tree-like graphs, Grammar-compressed indexes with logarithmic search time, Representation of ordered trees with a given degree distribution, Fully Functional Static and Dynamic Succinct Trees, Fast Compressed Tries through Path Decompositions, General Document Retrieval in Compact Space, Succinct Representations of Ordinal Trees, Lempel Ziv Computation in Small Space (LZ-CISS), Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet, Self-indexing Based on LZ77, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations, Unnamed Item, Self-indexed Text Compression Using Straight-Line Programs, A Uniform Approach Towards Succinct Representation of Trees, Faster and Space-Optimal Edit Distance “1” Dictionary