The pairing heap: A new form of self-adjusting heap
Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue) called theFibonacci heap. Although theoretically efficient, Fibonacci heaps are complicated to implement and not as fast in practice as other kinds of heaps. In this paper we describe a new form of heap, called thepairing heap, intended to be competitive with the Fibonacci heap in theory and easy to implement and fast in practice. We provide a partial complexity analysis of pairing heaps. Complete analysis remains an open problem.
Key WordsData structure Heap Priority queue
Unable to display preview. Download preview PDF.
- C. A. Crane, “Linear lists and priority queues as balanced binary trees,” Technical Report STAN-CS-72-259, Computer Science Department, Stanford University, Stanford, CA, 1972.Google Scholar
- M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,”J. Assoc. Comput. Mach., submitted; alsoProc. 25th Annual IEEE Symp. on Found. of Comput. Sci. (1984), 338–346.Google Scholar
- H. N. Gabow, Z. Galil, and T. Spencer, “Efficient implementation of graph algorithms using contraction,”Proc. 25th Annual IEEE Symp. on Found. of Comput. Sci. (1984).Google Scholar
- H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, “Efficient algorithms for finding minimum spanning trees in undirected and directed graphs,”Combinatorica, to appear.Google Scholar
- D. W. Jones, “An empirical comparison of priority queues and event set algorithms,”Comm. ACM, submitted.Google Scholar
- D. E. Knuth,The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Second Edition, Addison-Wesley, Reading, MA, 1973.Google Scholar
- D. E. Knuth,The Art of Computer Programming, Vol. 3:Sorting and Searching, Addison-Wesley, Reading, MA, 1973.Google Scholar
- D. D. Sleator and R. E. Tarjan, “Self-adjusting binary trees, Proc. 15th AnnualACM Symp. on Theory of Comput. (1983), 235–245.Google Scholar
- D. D. Sleator and R. E. Tarjan, “Self-adjusting heaps,”SIAM J. Comput., to appear.Google Scholar
- R. E. Tarjan,Data Structures and Network Algorithms, CBMS 44, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.Google Scholar
- J. W. J. Williams, “Algorithm 232: Heapsort,”Comm. ACM 7 (1964), 347–348.Google Scholar