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
- The Art of Computer Programming
- The Design and Analysis of Computer Algorithms
- Complexity of Computer Computations
- Shortest Connection Networks And Some Generalizations
- A Tournament Problem
- Fundamental Algorithms
- Algorithm 245: Treesort
- Finding Minimum Spanning Trees
- Efficiency of Equivalence Algorithms
- Design and implementation of an efficient priority queue