The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

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

배열 표현을 이용한 M-힙에서 삽입/삭제 알고리즘

  • 정해재 (안동대학교 공과대학 정보통신공학과)
  • Published : 2006.06.01
Download PDF
⟨ Previous Next ⟩

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.

스케줄링, 정렬, 및 최단 거리 계산 네트워크 문제 등과 같은 응용에 이용될 수 있는 우선 순위 큐 중, 피보나치 힙, 페어링 힙, 및 M-힙은 포인터를 이용하는 자료 구조이다. 본 논문에서는 [1]에서 문제점으로 남겨두었던 M-힙을 배열을 이용하여 표현한 MA-힙(M-heap with an array representation)를 제안한다. MA-힙은 M-힙과 동일한 시간 복잡도인 O(1) 삽입 전이 시간과 O(logn) 삭제 시간 복잡도를 가지며, 단순한 전통적인 힙에 근거하고 있기 때문에 [5]에서 제안된 힙보다 구현이 매우 용이하다.

Keywords

References

  1. 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 https://doi.org/10.1142/S0129054103001856
  2. M. Fredman and R. Tarjan, 'Fibonacci heaps and their uses in improved network optimization algorithms,' JACM, 34(3), pp.596-615, 19871 https://doi.org/10.1145/28869.28874
  3. 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 https://doi.org/10.1007/BF01840439
  4. T.J. Stasko and J.S. Vitter, 'Pairing heaps: experiments and analysis', Communications of the ACM, 30(3), pp.234-249, 1987 https://doi.org/10.1145/214748.214759
  5. 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
  6. E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++, W. H. Freeman, San Francisco, 1995
  7. D. Mehta, and S. Sahni(ed.), Handbook of Data Structures and Applications, Chapman & Hall/CRC, New York, 2005
  8. 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 https://doi.org/10.1145/235141.235146
  9. H. Jung, 'The d-deap*: A fast and simple cache-aligned d-ary deap', Information Processing Letters, 93(2), pp.63-67, Jan., 2005 https://doi.org/10.1016/j.ipl.2004.10.001

Cited by

  1. A SIMPLE ARRAY VERSION OF M-HEAP vol.25, pp.01, 2014, https://doi.org/10.1142/S012905411450004X