Maximum Matching in Regular and Almost Regular Graphs

Raphael Yuster

doi:https://doi.org/10.1007/s00453-012-9625-7

Maximum Matching in Regular and Almost Regular Graphs

Raphael Yuster

Department of Mathematics

University of Haifa

Research output: Contribution to journal › Article › peer-review

Abstract

We present an O(n ²logn)-time algorithm that finds a maximum matching in a regular graph with n vertices. More generally, the algorithm runs in O(rn ²logn) 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 O(√nm) -time for graphs with m edges, whenever m=ω(rn ^1.5logn).

Original language	American English
Pages (from-to)	87-92
Number of pages	6
Journal	Algorithmica
Volume	66
Issue number	1
DOIs	https://doi.org/10.1007/s00453-012-9625-7
State	Published - May 2013

Keywords

Algorithm
Maximum matching
Regular graph

All Science Journal Classification (ASJC) codes

General Computer Science
Applied Mathematics
Computer Science Applications

Access to Document

https://doi.org/10.1007/s00453-012-9625-7

Cite this

@article{8a6bb340e9f6476f8412dff27be04be3,

title = "Maximum Matching in Regular and Almost Regular Graphs",

abstract = "We present an O(n 2logn)-time algorithm that finds a maximum matching in a regular graph with n vertices. More generally, the algorithm runs in O(rn 2logn) 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 O(√nm) -time for graphs with m edges, whenever m=ω(rn 1.5logn).",

keywords = "Algorithm, Maximum matching, Regular graph",

author = "Raphael Yuster",

year = "2013",

month = may,

doi = "https://doi.org/10.1007/s00453-012-9625-7",

language = "American English",

volume = "66",

pages = "87--92",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Maximum Matching in Regular and Almost Regular Graphs

AU - Yuster, Raphael

PY - 2013/5

Y1 - 2013/5

N2 - We present an O(n 2logn)-time algorithm that finds a maximum matching in a regular graph with n vertices. More generally, the algorithm runs in O(rn 2logn) 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 O(√nm) -time for graphs with m edges, whenever m=ω(rn 1.5logn).

AB - We present an O(n 2logn)-time algorithm that finds a maximum matching in a regular graph with n vertices. More generally, the algorithm runs in O(rn 2logn) 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 O(√nm) -time for graphs with m edges, whenever m=ω(rn 1.5logn).

KW - Algorithm

KW - Maximum matching

KW - Regular graph

UR - http://www.scopus.com/inward/record.url?scp=84874656086&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s00453-012-9625-7

DO - https://doi.org/10.1007/s00453-012-9625-7

M3 - Article

SN - 0178-4617

VL - 66

SP - 87

EP - 92

JO - Algorithmica

JF - Algorithmica

IS - 1

ER -

Maximum Matching in Regular and Almost Regular Graphs

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this