@inproceedings{5dde8efbe2a14f6e9dcc73a1aa8191e2,
title = "Fibonacci heaps and theie uses in improved network optimization algorithms",
abstract = "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 O(log n) amortized time and all other standard heap operations in O(1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms.",
author = "Fredman, {Michael L.} and Tarjan, {Robert Endre}",
note = "Publisher Copyright: {\textcopyright} 1984 IEEE.; 25th Annual Symposium on Foundations of Computer Science, FOCS 1984 ; Conference date: 24-10-1984 Through 26-10-1984",
year = "1984",
language = "English (US)",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "338--346",
booktitle = "25th Annual Symposium on Foundations of Computer Science, FOCS 1984",
address = "United States",
}