Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2006.13A.3.261

Insertion/Deletion algorithms on M-heap with an array representation  

Jung Hae-Jae (안동대학교 공과대학 정보통신공학과)
Publication Information
The KIPS Transactions:PartA / v.13A, no.3, 2006 , pp. 261-266 More about this Journal
Abstract
Priority queues can be used in applications such as scheduling, sorting, and shortest path network problem. Fibonacci heap, pairing heap, and M-heap are priority queues based on pointers. This paper proposes a modified M-heap with an way representation, called MA-heap, that resolves the problem mentioned in [1]. The MA-heap takes O(1) amortized time and O(logn) time to insert an element and delete the max/min element, respectively. These time complexities are the same as those of the M-heap. In addition, it is much easier to implement an MA-heap than a heap proposed in [5] since it is based on the simple traditional heap.
Keywords
Data Structure; Priority Queue; Heap; Amortized Time Complexity;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. Jung, 'The d-deap*: A fast and simple cache-aligned d-ary deap', Information Processing Letters, 93(2), pp.63-67, Jan., 2005   DOI   ScienceOn
2 A. LaMarca, and R. Ladner, 'The Influence of Caches on the Performance of Heaps,' ACM Jounrnal of Experimental Algorithrnics, 1(4), pp.1-32, 1996   DOI
3 S. Carlsson, J. Munro, and P. Poblete, 'An implicit binomial queue with constant insertion time', Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, 318, pp.1-13, July, 1988
4 E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++, W. H. Freeman, San Francisco, 1995
5 D. Mehta, and S. Sahni(ed.), Handbook of Data Structures and Applications, Chapman & Hall/CRC, New York, 2005
6 M. Fredman and R. Tarjan, 'Fibonacci heaps and their uses in improved network optimization algorithms,' JACM, 34(3), pp.596-615, 19871   DOI   ScienceOn
7 M. Fredman, R. Sedgewick, R. Sleator, and R. Tarjan, 'The pairing heap: A new form of self-adjusting heap', Algorithmica, 1, pp.111-129, 1, Mar., 1986   DOI
8 T.J. Stasko and J.S. Vitter, 'Pairing heaps: experiments and analysis', Communications of the ACM, 30(3), pp.234-249, 1987   DOI   ScienceOn
9 S. Bansal, S. Sreekanth, and P. Gupta, 'M-heap : A Modified heap data structures', International Journal of Foundations of Computer Science, 14(3), pp.491-502, 2003   DOI   ScienceOn