论文信息 - The pairing heap: A new form of self-adjusting heap

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.

[1] Jean Vuillemin,et al. A data structure for manipulating priority queues , 1978, CACM.

[2] Robert E. Tarjan,et al. Self-adjusting binary trees , 1983, STOC.

[3] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[4] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[5] R. Tarjan. Amortized Computational Complexity , 1985 .

[6] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[7] Clark A. Crane,et al. Linear Lists and Prorty Queues as Balanced Binary Trees , 1972, Outstanding Dissertations in the Computer Sciences.

[8] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[9] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[10] Mark R. Brown,et al. Implementation and Analysis of Binomial Queue Algorithms , 1978, SIAM J. Comput..

[11] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[12] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[13] Zvi Galil,et al. Efficient implementation of graph algorithms using contraction , 1984, JACM.

[14] Robert E. Tarjan,et al. Self-Adjusting Heaps , 1986, SIAM J. Comput..