On Cartesian trees and range minimum queries

Author(s)
Demaine, Erik D.; Landau, Gad M.; Weimann, Oren
Thumbnail
DownloadDemaine_On Cartesian.pdf (202.8Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Date issued
2009-07
URI
http://hdl.handle.net/1721.1/61963
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-3-642-02926-4
Collections