As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports n insert, n delete-min, and m decrease-key operations in O(m+n log n) time. Our experiments show the 2-3 heap is more efficient. The new data structure will have a wide application in graph algorithms
We give a variation of the pairing heaps for which the time bounds for all the operations match the ...
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjo...
A Fibonacci heap is a deterministic data structure implementing a priority queue with op-timal amort...
AbstractAs an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, w...
As an alternative to the Fibonacci heap, and a variation of the 2-3 heap data structure by Tadao Tak...
AbstractAs an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, w...
We design a new data structure, called a trinomial heap, which supports the decrease-key in O(1) tim...
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time...
In this paper we explore Fibonacci heaps and their variants. The alternative versions of the Fibonac...
We introduce the hollow heap, a very simple data structure with the same amortized efficiency as the...
\u3cp\u3eThe pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewic...
AbstractIn this paper we present a new view of a classical data structure, the heap. We view a heap ...
This paper presents three new results on data structures which lead to improvement in two classical ...
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleato...
A lower bound is presented which shows that a class of heap algorithms in the pointer model with onl...
We give a variation of the pairing heaps for which the time bounds for all the operations match the ...
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjo...
A Fibonacci heap is a deterministic data structure implementing a priority queue with op-timal amort...
AbstractAs an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, w...
As an alternative to the Fibonacci heap, and a variation of the 2-3 heap data structure by Tadao Tak...
AbstractAs an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, w...
We design a new data structure, called a trinomial heap, which supports the decrease-key in O(1) tim...
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time...
In this paper we explore Fibonacci heaps and their variants. The alternative versions of the Fibonac...
We introduce the hollow heap, a very simple data structure with the same amortized efficiency as the...
\u3cp\u3eThe pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewic...
AbstractIn this paper we present a new view of a classical data structure, the heap. We view a heap ...
This paper presents three new results on data structures which lead to improvement in two classical ...
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleato...
A lower bound is presented which shows that a class of heap algorithms in the pointer model with onl...
We give a variation of the pairing heaps for which the time bounds for all the operations match the ...
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjo...
A Fibonacci heap is a deterministic data structure implementing a priority queue with op-timal amort...
DOI
Add to ORKG