A data structure for manipulating priority queues

Jean E. Vuillemin · Communications of the ACM · 1978

A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.

Cited by 315 works. doi:10.1145/359460.359478 Open-access PDF

Authors

References