Article

Algorithmica

, Volume 3, Issue 1, pp 511-533

The general maximum matching algorithm of micali and vazirani

  • Paul A. PetersonAffiliated withDepartment of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
  • , Michael C. LouiAffiliated withDepartment of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We give a clear exposition of the algorithm of Micali and Vazirani for computing a maximum matching in a general graph. This is the most efficient algorithm known for general matching. On a graph withn vertices andm edges this algorithm runs inO(n 1/2 m) time.

Key words

Matching Graph algorithm Combinatorial optimization