On Cartesian trees and range minimum queries

On Cartesian trees and range minimum queries

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...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D. (Contributor), Landau, Gad M. (Author), Weimann, Oren (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer Berlin / Heidelberg, 2011-03-25T15:21:18Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items