We define two generalized types of a priority queue by allowing some forms of changing the priorities of the elements in the queue. We show that they can be implemented efficiently. Consequently, each operation takes O(log n) time. We use these generalized priority queues to construct an O(EVlog V) algorithm for finding a maximal weighted matching in general graphs.
No takes yet. Share an insight, caveat, or question.
Galil et al. (1986) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: