Results 1  10
of
78
Fibonacci heaps revisited
 CoRR
"... The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heap operations in O(1) amortized time. We explore the design space of this data structure. We propose a version with the following improvements over the original: (i) Each heap is repr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heap operations in O(1) amortized time. We explore the design space of this data structure. We propose a version with the following improvements over the original: (i) Each heap
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized
Are Fibonacci Heaps Optimal?
 ISAAC'94, LNCS
, 1994
"... In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable assumptions, there exist sequences of n Insert, n Delete, m DecreaseKey and t FindMin operations, where 1 t n, which have W(nlogt + n + m) complexity. Although Fibonacci h ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
heaps do not achieve this bound, we present a modified Fibonacci heap which does, and so is optimal under our assumptions.
Strict Fibonacci Heaps
 STOC
, 2012
"... We present the first pointerbased heap implementation with time bounds matching those of Fibonacci heaps in the worst case. We support makeheap, insert, findmin, meld and decreasekey in worstcase O(1) time, and delete and deletemin in worstcase O(lgn) time, where n is the size of the heap. The ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We present the first pointerbased heap implementation with time bounds matching those of Fibonacci heaps in the worst case. We support makeheap, insert, findmin, meld and decreasekey in worstcase O(1) time, and delete and deletemin in worstcase O(lgn) time, where n is the size of the heap
An Interactive Fibonacci Heap Applet
"... A Fibonacci heap (Fheap) is a collection of heapordered trees. Fheaps are the type of data structure in which the work that must be done to reorder the structure is postponed until the very last possible moment. Fheaps are useful for algorithms involving graph data structures, such as those used ..."
Abstract
 Add to MetaCart
A Fibonacci heap (Fheap) is a collection of heapordered trees. Fheaps are the type of data structure in which the work that must be done to reorder the structure is postponed until the very last possible moment. Fheaps are useful for algorithms involving graph data structures, such as those
Violation heaps: A better substitute for Fibonacci heaps
, 2008
"... We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, findmin requires O(1) worstcase time, insert, meld and decreasekey require O(1) amortized time, and deletemin requires O(log n) amortized time. Our structure is simple and promises a more efficient pract ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, findmin requires O(1) worstcase time, insert, meld and decreasekey require O(1) amortized time, and deletemin requires O(log n) amortized time. Our structure is simple and promises a more efficient
Thin Heaps, Thick Heaps
, 2006
"... The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra’s shortest path algorithm. Although asyptotically efficient, it is not as fast in practice as other heap implementations. Expanding on ideas of Høyer, we describe three heap implementations (two versions of ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra’s shortest path algorithm. Although asyptotically efficient, it is not as fast in practice as other heap implementations. Expanding on ideas of Høyer, we describe three heap implementations (two versions
Replacing mark bits with randomness in Fibonacci heaps
, 2014
"... A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized asymptotic operation costs. An unaesthetic aspect of Fibonacci heaps is that they must maintain a “mark bit ” which serves only to ensure efficiency of heap operations, not their correctness. Kar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized asymptotic operation costs. An unaesthetic aspect of Fibonacci heaps is that they must maintain a “mark bit ” which serves only to ensure efficiency of heap operations, not their correctness
Results 1  10
of
78