Path minima queries in dynamic weighted trees
From MaRDI portal
Recommendations
Cited in
(25)- The nearest colored node in a tree
- Partially dynamic maintenance of minimum weight hyperpaths
- Dynamic path queries in linear space
- Faster online computation of the succinct longest previous factor array
- Shortest unique palindromic substring queries in semi-dynamic settings
- Linear-space data structures for range mode query in arrays
- Succinct indices for path minimum, with applications
- scientific article; zbMATH DE number 1670815 (Why is no real title available?)
- Dynamic weighted ancestors
- Dynamic path counting and reporting in linear space
- Path queries in weighted trees
- Path Minima in Incremental Unrooted Trees
- Minimizing diameters of dynamic trees
- Efficient dynamic range minimum query
- Dynamic LCA Queries on Trees
- The nearest colored node in a tree
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
- Data structures for computing unique palindromes in static and non-static strings
- Finding maximum matchings in RDV graphs efficiently
- Quantum data structure for range minimum query
- Faster path queries in colored trees via sparse matrix multiplication and min-plus product
- Approximate circular pattern matching
- Almost optimal exact distance oracles for planar graphs
- Faster approximate elastic-degenerate string matching. Part A
- Weighted hypertree decompositions and optimal query plans
This page was built for publication: Path minima queries in dynamic weighted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199250)
