Path minima queries in dynamic weighted trees

DOI10.1007/978-3-642-22300-6_25MaRDI QIDQ5199250zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Pooya Davoodi, 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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Path Minima in Incremental Unrooted Trees
• Dynamic path queries in linear space
• Path queries in weighted trees
• Dynamic weighted ancestors
• scientific article; zbMATH DE number 1670815

Cited in

(19)

• Faster online computation of the succinct longest previous factor array
• Succinct indices for path minimum, with applications
• Partially dynamic maintenance of minimum weight hyperpaths
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Minimizing diameters of dynamic trees
• scientific article; zbMATH DE number 1670815 (Why is no real title available?)
• Path queries in weighted trees
• Weighted hypertree decompositions and optimal query plans
• Shortest unique palindromic substring queries in semi-dynamic settings
• Linear-space data structures for range mode query in arrays
• Dynamic path queries in linear space
• Dynamic path counting and reporting in linear space
• Dynamic weighted ancestors
• Dynamic LCA Queries on Trees
• The nearest colored node in a tree
• Efficient dynamic range minimum query
• The nearest colored node in a tree
• Path Minima in Incremental Unrooted Trees
• Data structures for computing unique palindromes in static and non-static strings

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)