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.
No takes yet. Share an insight, caveat, or question.
Jean Vuillemin (1978) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: