DMCA
Meldable Heaps and Boolean Union-Find (Extended Abstract) (2002)
BibTeX
@MISC{Kaplan02meldableheaps,
author = {Haim Kaplan and Nira Shafrir and Robert E Tarjan},
title = {Meldable Heaps and Boolean Union-Find (Extended Abstract)},
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert, delete, decrease-key, and meld. In the usual definition decrease-key and delete get the item and the heap containing it as parameters. We consider the modified problem where decrease-key and delete get only the item but not the heap containing it. We show that for this problem one of the operations find-min, decrease-key, or meld must take non-constant time. This is in contrast with the original data type in which data structures supporting all these three operations in constant time are known (both in an amortized and a worst-case setting).
