Abstract
We introduce a new representation of a priority queue in an array such that the operation of insert can be performed in constant time and minimum extraction in logarithmic time. In developing this structure we first introduce a very simple scheme permitting insertions in constant amortized time. This is modified to achieve the worst-case behavior using roughly lg*n pairs of pointers, and finally this pointer requirement is removed.
This work was supported by the Natural Science and Engineering Research Council of Canada under grant A8237 and by the Information Technology Research Centre of Ontario.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Carlsson, Heaps, doctoral dissertation, Department of Computer Science, Lund University, Lund, Sweden, CODEN: LUNFD6/ (NFCS-1003)/(1-70)/(1986)
M. J. Clancy and D. E. Knuth, A programming and problem-solving seminar, Technical report, Computer Science Department, School of Humanities and Science, Stanford University, STAN-CS-77-606, (April 1977)
E. E. Doberkat, Deleting the root of a heap, Acta Informatica, 17 (1982), 245–265
E. E. Doberkat, Inserting a new element into a heap, BIT, 21, (1981), 255–269
M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Proc. 25th Annual IEEE Symp. on Found. of Comput. Sci., (1984), 338–346
G. H. Gonnet and J. I. Munro, Heaps on heaps, SIAM J. on Comp. 15,4: 964–971, (Nov. 1986).
J. I. Munro and P. V. Poblete, Searchability in Merging and Implicit Data Structures, to appear in BIT.
Th. Porter and I. Simon, Random insertion into a priority queue structure, IEEE Trans. Software Engeneering, 1 SE (1975), 292–298
Th. Strothotte and J.-R. Sack, Heaps in heaps, Congressus Numerantium, 49 (1985), 223–235
R. E. Tarjan, Amortized computational complexity, SIAM J. Alg. Disc. Meth. 6 (1985), 306–318
J. W. J. Williams, Algorithm 232, CACM, 7(6) (June 1964), 347–348
J. Vuillemin, A data structure for manipulating priority queues, CACM, 21 (1978), 309–314
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlsson, S., Munro, J.I., Poblete, P.V. (1988). An implicit binomial queue with constant insertion time. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_1
Download citation
DOI: https://doi.org/10.1007/3-540-19487-8_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19487-3
Online ISBN: 978-3-540-39288-0
eBook Packages: Springer Book Archive