Path Minima Queries in Dynamic Weighted Trees
From MaRDI portal
Publication:5199250
DOI10.1007/978-3-642-22300-6_25zbMath1342.68106OpenAlexW1585496880MaRDI QIDQ5199250
Pooya Davoodi, Gerth Stølting Brodal, S. Srinivasa Rao
Publication date: 12 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_25
Related Items (9)
Succinct indices for path minimum, with applications ⋮ Shortest unique palindromic substring queries in semi-dynamic settings ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Data structures for computing unique palindromes in static and non-static strings ⋮ A simple linear-space data structure for constant-time range minimum query ⋮ Efficient dynamic range minimum query ⋮ Linear-space data structures for range mode query in arrays ⋮ Dynamic path queries in linear space ⋮ Faster online computation of the succinct longest previous factor array
This page was built for publication: Path Minima Queries in Dynamic Weighted Trees
