Min-Max Fine Heaps
Data Structures and Algorithms
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.cs/0007043,
title = {Min-Max Fine Heaps},
author = {Suman Kumar Nath and Rezaul Alam Chowdhury and M. Kaykobad},
journal= {arXiv preprint arXiv:cs/0007043},
year = {2007}
}
Comments
6 pages, pdf file