Path Minima in Incremental Unrooted Trees

DOI10.1007/978-3-540-87744-8_47zbMath1158.68361OpenAlexW1481686123MaRDI QIDQ3541117

Nira Shafrir, Haim Kaplan

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_47

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

Succinct indices for path minimum, with applications ⋮ Path Minima in Incremental Unrooted Trees ⋮ Dynamic path queries in linear space

Cites Work

• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Applications of Path Compression on Balanced Trees
• Data structures for mergeable trees
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• Path Minima in Incremental Unrooted Trees
• Design of data structures for mergeable trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Path Minima in Incremental Unrooted Trees