Relaxed min-max 힘에 대한 병합 알고리즘

On Merging Algorithm for Relaxed Min-Max Heaps

This paper presents a data structure that implements a mergeable double-ended priority queue; namely, an improved relaxed min-max-pair heap. It suggests a sequential algorithm to merge priority queues organized in two relaxed min-max heaps: kheap and nheap of sizes k and n, respectively. This new data structure eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [8]. As a result, the suggested method in this paper requires the time complexity of O(log(log(n/k))*log(k)) and the space complexity of O(n+k), assuming that k≤[log(size(nheap))] are in two heaps of different sizes.