Fibonacci heap

Known as: Fibbonaci heaps, Fib heap, Fibanocci Heap 
In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heap… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2012
2012
We present the first pointer-based heap implementation with time bounds matching those of Fibonacci heaps in the worst case. We… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2010
2010
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case… (More)
Is this relevant?
2006
2006
We construct a readable, compact and efficient implementation of Dijkstra’s shortest path algorithm and Fibonacci heaps using… (More)
Is this relevant?
1994
1994
In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable… (More)
  • table 1
  • figure 1
Is this relevant?
1992
1992
We consider the requirements for uniform pseudo-random number generators on modern vector and parallel supercomputers, consider… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue) called theFibonacci heap… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1984
1984
We consider Fibonacci heap style integer priority queues supporting find-min, insert, and decrease key operations in constant… (More)
Is this relevant?