The general maximum matching algorithm of Micali and Vazirani

DOI10.1007/BF01762129zbMath0648.68077OpenAlexW2066511816MaRDI QIDQ1105385

Paul A. Peterson, Michael C. Loui

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762129

zbMATH Keywords

combinatorial optimizationgraph algorithmmaximum matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

The general maximum matching algorithm of Micali and Vazirani ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ An efficient distributed algorithm for maximum matching in general graphs ⋮ Affine-invariant strictly cyclic Steiner quadruple systems ⋮ An algorithm for computing simple \(k\)-factors ⋮ Three-quarter approximation for the number of unused colors in graph coloring ⋮ MINING POSETS FROM LINEAR ORDERS

Cites Work

• A linear-time algorithm for a special case of disjoint set union
• The general maximum matching algorithm of Micali and Vazirani
• A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
• TWO THEOREMS IN GRAPH THEORY
• Efficiency of a Good But Not Linear Set Union Algorithm
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Paths, Trees, and Flowers
• Optimal Sequencing of Two Equivalent Processors
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The general maximum matching algorithm of Micali and Vazirani