On Cartesian trees and range minimum queries
Name
Demaine_On Cartesian.pdf
Size
202.8 KB
Format
Adobe PDF
Checksum (MD5)
c452c869078fff595316dcab73e1cb7a
Author(s)
Demaine, Erik D.
Landau, Gad M.
Weimann, Oren
Date Issued
July 2009
Journal
Automata, Languages and Programming. Proceedings of the 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Part I
Publisher
Springer Berlin / Heidelberg
Citation
Demaine, Erik, Gad Landau, and Oren Weimann. “On Cartesian Trees and Range Minimum Queries.” Automata, Languages and Programming. Springer Berlin / Heidelberg, 2009. 341-353-353.
Version
Author's final manuscript
Abstract
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the range minimum query problem, a Cartesian tree of a tree for the bottleneck edge query problem on trees and undirected graphs, and a proof that no Cartesian tree exists for the two-dimensional version of the range minimum query problem.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-02927-1_29
