On Cartesian trees and range minimum queries
Author(s)Demaine, Erik D.; Landau, Gad M.; Weimann, Oren
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Automata, Languages and Programming. Proceedings of the 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Part I
Springer Berlin / Heidelberg
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.
Author's final manuscript