Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
M.L. Fredman , University of CA, San Diego
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in 0(log n) amortized time and all other standard heap operations in 0(1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms.
M.L. Fredman, R.E. Tarjan, "Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 338-346, doi:10.1109/SFCS.1984.715934