Min-Max Fine Heaps

Details Min-Max Fine Heaps Min-Max Fine Heaps

2000-07-31

arxiv.org/abs/cs/0007043v1

Computer Science

Data Structures and Algorithms

6 pages, pdf file

Scientific paper

In this paper we present a new data structure for double ended priority
queue, called min-max fine heap, which combines the techniques used in fine
heap and traditional min-max heap. The standard operations on this proposed
structure are also presented, and their analysis indicates that the new
structure outperforms the traditional one.

Affiliated with

Also associated with

No associations

Rating

Min-Max Fine Heaps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Min-Max Fine Heaps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Min-Max Fine Heaps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-301683