Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest and Clifford Stein : Chapter 20

The authors discuss Fibonacci heaps in this chapter. Fibonacci heaps support same operations as binomial heaps except that the operations that do not involve deleting an element take $ O(1) $ amortized time. Fibonacci heaps have more relaxed structure than binomial heaps and the work that maintains the structure is delayed until it is convenient to perform.

The authors then describe the structure of fibonacci heaps. The authors then provide algorithm to implement all the operations and prove their running time complexity.