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)

Related topics

Related topics

6 relations
Binary heapBinary treeFibonacci heapHeap (data structure)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Weak Heaps and Friends: Recent Developments
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
Weak heaps engineered
Review
2013
Review
2013
Combinatorial Algorithms
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
A Catalogue of Algorithms for Building Weak Heaps
An array-based weak heap is an efficient data structure for realizing an elementary priority queue. In this paper we focus on the… 
2012
2012
The weak-heap data structure: Variants and applications
2012
2012
Υπολογιστική σύγκριση των αλγορίθμων heap sort και weak heap sort.
2011
2011
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort
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
Policy-Based Benchmarking of Weak Heaps and Their Relatives,
In this paper we describe an experimental study where we evaluated the practical efficiency of three worst-case efficient… 
2005
2005
Relaxed Weak Queues: An Alternative to Run-Relaxed Heaps
A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This new priority-queue implementation… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)