Name
Abstract | ||
|---|---|---|
We introduce the hollow heap, a very simple data structure with the same amortized efficiency as the classical Fibonacci heap. All heap operations except delete and delete-min take O(1) time, worst case as well as amortized; delete and delete-min take O(log n) amortized time on a heap of n items. Hollow heaps are the simplest structure to achieve these bounds. Hollow heaps combine two novel ideas: the use of lazy deletion and re-insertion to do decrease-key operations and the use of a dag (directed acyclic graph) instead of a tree or set of trees to represent a heap. Lazy deletion produces hollow nodes (nodes without items), giving the data structure its name. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/3093240 | ACM Transactions on Algorithms (TALG) |
DocType | Volume | Issue |
Conference | 13 | 3 |
ISSN | Citations | PageRank |
1549-6325 | 0 | 0.34 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Dueholm Hansen | 1 | 161 | 13.77 |
| Haim Kaplan | 2 | 3581 | 263.96 |
| Robert Endre Tarjan | 3 | 25160 | 6384.61 |
| Uri Zwick | 4 | 3586 | 257.02 |