Succinct indices for path minimum, with applications
From MaRDI portal
Recommendations
Cites work
- A data structure for dynamic trees
- A Data Structure for Dynamically Maintaining Rooted Trees
- A framework for succinct labeled ordinal trees over large alphabets
- A linear lower bound on index size for text retrieval
- A simpler minimum spanning tree verification algorithm
- A survey on tree edit distance and related problems
- A uniform paradigm to succinctly encode various families of trees
- A unifying look at data structures
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
- An inverse-Ackermann type lower bound for online minimum spanning tree verification
- Compressed representations of sequences and full-text indexes
- Computing on a free tree via complexity-preserving mappings
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Dynamic path counting and reporting in linear space
- Fast Algorithms for Finding Nearest Common Ancestors
- scientific article; zbMATH DE number 1670815 (Why is no real title available?)
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 2226802 (Why is no real title available?)
- Introduction to algorithms.
- Linear verification for spanning trees
- Linear-space data structures for range frequency queries on arrays and trees
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- Lower bounds on the size of selection and rank indexes
- More haste, less waste: lowering the redundancy in fully indexable dictionaries
- On Cartesian Trees and Range Minimum Queries
- On space efficient two dimensional range minimum data structures
- Optimal lower bounds for rank and select indexes
- Optimal static range reporting in one dimension
- Orthogonal range searching on the RAM, revisited
- Path Minima in Incremental Unrooted Trees
- Path minima queries in dynamic weighted trees
- Path queries in weighted trees
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Squeezing succinct data structures into entropy bounds
- Succinct Data Structures for Path Queries
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct indices for path minimum, with applications to path reporting
- Succinct ordinal trees based on tree covering
- Succinct ordinal trees with level-ancestor queries
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct representation of balanced parentheses and static trees
- Succinct representations of weighted trees supporting path queries
- Succinct sampling from discrete distributions
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
- Two Dimensional Range Minimum Queries and Fibonacci Lattices
- Universal Succinct Representations of Trees?
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
Cited in
(11)- Path queries on functions
- Data structures for categorical path counting queries
- Succinct representations of weighted trees supporting path queries
- Succinct indices for path minimum, with applications to path reporting
- Path queries on functions
- scientific article; zbMATH DE number 7651193 (Why is no real title available?)
- Shortest beer path queries in outerplanar graphs
- On approximate colored path counting
- Path and ancestor queries over trees with multidimensional weight vectors
- Faster path queries in colored trees via sparse matrix multiplication and min-plus product
- Tree path majority data structures
This page was built for publication: Succinct indices for path minimum, with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362355)
