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