An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

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(EV\lo...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 15; no. 1; pp. 120 - 130
Main Authors Galil, Zvi, Micali, Silvio, Gabow, Harold
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1986
Subjects
Algorithms
Combinatorics
Combinatorics. Ordered structures
Computer science
Exact sciences and technology
Graph theory
Graphs
Mathematics
Sciences and techniques of general use
Edge(graph)
Graph theory
Algorithm
Algorithm complexity
Graph matching
Online AccessGet full text
ISSN0097-5397
1095-7111
DOI10.1137/0215009

Cover

More Information
Summary: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(EV\log V)$ algorithm for finding a maximal weighted matching in general graphs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0097-5397
1095-7111
DOI:10.1137/0215009