Fibonacci heaps and their uses in improved network optimization algorithms

@article{Fredman1987FibonacciHA,
title={Fibonacci heaps and their uses in improved network optimization algorithms},
author={M. Fredman and R. Tarjan},
journal={J. ACM},
year={1987},
volume={34},
pages={596-615}
}

In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps</italic> (abbreviated <italic>F-heaps</italic>), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an <italic>n</italic>-item heap in <italic>O</italic>(log <italic>n</italic>) amortized time and all other standard heap operations in <italic>O</italic>(1) amortized time. Using F-heaps we are able to… CONTINUE READING