FAQ

Mergeable heap

Known as: Meldable heap 
In computer science, a mergeable heap (also called a meldable heap) is an abstract data type, which is a heap supporting a merge operation.
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2009
0119752009

Related topics

Related topics

7 relations
Abstract data typeBinomial heapComputer scienceFibonacci heap
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Mergeable heap
Computer science
Heap
Abstract data type
Binomial heap
Fibonacci heap

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Algorithms Non - Lecture L : Fibonacci Heaps
  • David Letterman
  • 2009
If we never had to use DELETEMIN, mergeable heaps would be completely trivial. Each “heap” just stores to maintain the single… (More)
Is this relevant?
2002
2002
Meldable heaps and boolean union-find
In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations <i>find-min</i… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Self-Adjusting Heaps
In this paper we explore two themes in data structure design: amortized computational complexity and self-adjustment. We are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Design and implementation of an efficient priority queue
We present a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate on-line a priority queue… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Preserving order in a forest in less than logarithmic time
We present a data structure, based upon a stratified binary tree, which enables us to manipulate on-line a priority queue whose… (More)
Is this relevant?