Weak heap

A weak heap is a priority queue that supports the operations construct, minimum, insert, and extract-min. To store n elements, it… Expand

A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children… Expand

A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children… Expand

An array-based weak heap is an efficient data structure for realizing an elementary priority queue. In this paper we focus on the… Expand

The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports the… Expand

 

In this paper we introduce two efficient priority queues. For both, insert requires O(1) amortized time and extract-min$O(\lg n… Expand

In this paper we describe an experimental study where we evaluated the practical efficiency of three worst-case efficient… Expand

A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This new priority-queue implementation… Expand