Abstract
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. © 1978, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Vuillemin, J. (1978). A Data Structure for Manipulating Priority Queues. Communications of the ACM, 21(4), 309–315. https://doi.org/10.1145/359460.359478
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free