Maximum Matching in Regular and Almost Regular Graphs

Research output: Contribution to journalArticlepeer-review

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).

Original languageEnglish
Pages (from-to)87-92
Number of pages6
JournalAlgorithmica
Volume66
Issue number1
DOIs
StatePublished - May 2013

Keywords

  • Algorithm
  • Maximum matching
  • Regular graph

ASJC Scopus subject areas

  • Computer Science (all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Maximum Matching in Regular and Almost Regular Graphs'. Together they form a unique fingerprint.

Cite this