Results

**1 - 1**of**1**### Strict Fibonacci Heaps

"... Wepresentthefirstpointer-basedheapimplementationwith time bounds matching those of Fibonacci heaps in the worst case. We support make-heap, insert, find-min, meld and decrease-key in worst-case O(1) time, and delete and deletemin in worst-case O(lgn) time, where n is the size of the heap. The data s ..."

Abstract
- Add to MetaCart

Wepresentthefirstpointer-basedheapimplementationwith time bounds matching those of Fibonacci heaps in the worst case. We support make-heap, insert, find-min, meld and decrease-key in worst-case O(1) time, and delete and deletemin in worst-case O(lgn) time, where n is the size of the heap. The data structure uses linear space. A previous, very complicated, solution achieving the same time bounds in the RAM model made essential use of arrays and extensive use of redundant counter schemes to maintain balance. Our solution uses neither. Our key simplification is to discard the structure of the smaller heap when doing a meld. We use the pigeonhole principle in place of the redundant counter mechanism.