Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Weak heap

A weak heap is a variation of the a binary heap data structure.
Wikipedia

Related topics

Related topics

6 relations
Binary heapBinary treeFibonacci heapHeap (data structure)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Weak heaps engineered
A weak heap is a priority queue that supports the operations construct, minimum, insert, and extract-min. To store n elements, it… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
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… Expand
  • figure 1
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… Expand
  • figure 9
  • figure 10
  • figure 11
  • figure 9
  • figure 10
2012
2012
The weak-heap data structure: Variants and applications
The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports the… Expand
  • figure 1
  • figure 9
  • figure 10
  • table 1
  • figure 11
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… Expand
  • table 1
  • figure 2
  • table 5
  • table 6
  • table 8
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
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… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE