Author:
Stasko John T.,Vitter Jeffrey Scott
Abstract
The pairing heap has recently been introduced as a new data structure for priority queues. Pairing heaps are extremely simple to implement and seem to be very efficient in practice, but they are difficult to analyze theoretically, and open problems remain. It has been conjectured that they achieve the same amortized time bounds as Fibonacci heaps, namely,
O
(log
n
)
time for
delete
and
delete_min and O(1) for all other operations, where n is the size of the priority queue at the time of the operation. We provide empirical evidence that supports this conjecture. The most promising algorithm in our simulations is a new variant of the twopass method, called auxiliary twopass. We prove that, assuming no decrease_key operations are performed, it achieves the same amortized time bounds as Fibonacci heaps.
Publisher
Association for Computing Machinery (ACM)
Reference9 articles.
1. Aho A.V. Hopcroft. J.E. and Ullman J.D. The Design and Analysis of Compufer Algorithms. Addison-Wesley Reading M&s. 1974. Aho A.V. Hopcroft. J.E. and Ullman J.D. The Design and Analysis of Compufer Algorithms. Addison-Wesley Reading M&s. 1974.
2. Implementation and Analysis of Binomial Queue Algorithms
3. Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
4. The pairing heap: A new form of self-adjusting heap
5. An empirical comparison of priority-queue and event-set implementations
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献