Data Structures and Algorithm Analysis in C - SVS

Structures, Algorithm Analysis: CHAPTER 6: PRIORITY QUEUES (HEAPS)
11. M. L. Fredman and R. E. Tarjan, "Fibonacci Heaps and Their Uses in Improved Network
Optimization Algorithms," Journal of the ACM 34 (1987), 596-615.
12. G. H. Gonnet and J. I. Munro, "Heaps on Heaps," SIAM Journal on Computing 15 (1986), 964-971.
13. A. Hasham and J. R. Sack, "Bounds for Min-max Heaps," BIT 27 (1987), 315-323.
页码,45/46
14. D. B. Johnson, "Priority Queues with Update and Finding Minimum Spanning Trees," Information
Processing Letters 4 (1975), 53-57.
15. D. E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching, second printing,
Addison-Wesley, Reading, MA, 1975.
16. C. J. H. McDiarmid and B. A. Reed, "Building Heaps Fast," Journal of Algorithms 10 (1989),
352-365.
17. D. D. Sleator and R. E. Tarjan, "Self-adjusting Heaps," SIAM Journal on Computing 15 (1986),
52-69.
18. T. Strothotte, P. Eriksson, and S. Vallner, "A Note on Constructing Min-max Heaps," BIT 29
(1989), 251-256.
19. P. van Emde Boas, R. Kaas, E. Zijlstra, "Design and Implementation of an Efficient Priority
Queue," Mathematical Systems Theory 10 (1977), 99-127.
20. J. Vuillemin, "A Data Structure for Manipulating Priority Queues," Communications of the ACM
21 (1978), 309-314.
mk:@MSITStore:K:\Data.Structures.and.Algorithm.Analysis.in.C.chm::/...
2006-1-27