Maximum Matching in Regular and Almost Regular Graphs

We present an O ( n 2 log n )-time algorithm that finds a maximum matching in a regular graph with n vertices. More generally, the algorithm runs in O ( rn 2 log n ) time if the difference between the maximum degree and the minimum degree is less than r . This running time is faster than applying th...

Full description

Saved in:
Bibliographic Details
Published inAlgorithmica Vol. 66; no. 1; pp. 87 - 92
Main Author Yuster, Raphael
Format Journal Article
LanguageEnglish
Published New York Springer-Verlag 01.05.2013
Springer
Subjects
Algorithm Analysis and Problem Complexity
Algorithms
Applied sciences
Computer Science
Computer science; control theory; systems
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Exact sciences and technology
Information retrieval. Graph
Mathematics of Computing
Theoretical computing
Theory of Computation
Maximum matching
Algorithm
Regular graph
Edge(graph)
Maximal Matching
Graph matching
Online AccessGet full text
ISSN0178-4617
1432-0541
DOI10.1007/s00453-012-9625-7

Cover

More Information
Summary:We present an O ( n 2 log n )-time algorithm that finds a maximum matching in a regular graph with n vertices. More generally, the algorithm runs in O ( rn 2 log n ) time if the difference between the maximum degree and the minimum degree is less than r . This running time is faster than applying the fastest known general matching algorithm that runs in -time for graphs with m edges, whenever m = ω ( rn 1.5 log n ).
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-012-9625-7