Skip to search formSkip to main contentSkip to account menu

Weak heap

A weak heap is a variation of the a binary heap data structure.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
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… 
2013
2013
Review
2013
Review
2013
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… 
2012
2012
An array-based weak heap is an efficient data structure for realizing an elementary priority queue. In this paper we focus on the… 
2011
2011
In this paper we introduce two efficient priority queues. For both, insert requires O(1) amortized time and extract-min$O(\lg n… 
2010
2010
In this paper we describe an experimental study where we evaluated the practical efficiency of three worst-case efficient… 
2005
2005
A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This new priority-queue implementation…