Key points are not available for this paper at this time.
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.
Jean Vuillemin (Sat,) studied this question.