RAIRO-Theor. Inf. Appl.
Volume 51, Number 3, July-September 2017
|Page(s)||121 - 133|
|Published online||12 December 2017|
Bipartite binomial heaps
1 Department of Computer Engineering and Systems, Alexandria University, Egypt .
2 The Royal Library, Copenhagen, Denmark .
3 Department of Computer Science, University of Copenhagen, Denmark .
Received: 5 June 2016
Accepted: 25 September 2017
We describe a heap data structure that supports Minimum, Insert, and Borrow at O(1) worst-case cost, Delete at O(lgn) worst-case cost including at most lgn + O(1) element comparisons, and Union at O(lgn) worst-case cost including at most lgn + O(lglgn) element comparisons, where n denotes the (total) number of elements stored in the data structure(s) prior to the operation. As the resulting data structure consists of two components that are different variants of binomial heaps, we call it a bipartite binomial heap. Compared to its counterpart, a multipartite binomial heap, the new structure is simpler and mergeable, still retaining the efficiency of the other operations.
Mathematics Subject Classification: 68P05 / 68W01 / 68W40
Key words: Data structures / heaps / numeral systems / comparison complexity
© EDP Sciences 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.