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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Demaine, E. D., Landau, G. M., & Weimann, O. (2009). On cartesian trees and range minimum queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5555 LNCS, pp. 341–353). https://doi.org/10.1007/978-3-642-02927-1_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
