Min-max heap

In computer science, a min-max heap is a complete binary tree data structure which combines the usefulness of both a min-heap and a max-heap, that is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2013
01219862013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
One of the classic data structures for storing point sets in R is the priority search tree, introduced by McCreight in 1985. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
m this paper, lower and upper bounds for min-max pair heap construction has been presented. It has been shown that the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 7
Is this relevant?
2000
2000
In this paper we present a new data structure for double ended priority queue, called min-max fine heap, which combines the… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
1999
1999
Several data structures have been proposed to implement double-ended priority queue operations in O(log n) time, e.g., Min-Max… (More)
  • figure 1
Is this relevant?
1999
1999
,4 simple implementation of doubleended priority queues is presented. The proposed structure, called a min-max heap, can be built… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
1993
1993
A data structure that implements a mergeable double-ended priority queue, namely therelaxed min-max heap, is presented. A relaxed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built… (More)
  • figure 1
  • table I
  • table II
Is this relevant?