The general maximum matching algorithm of Micali and Vazirani

DOI10.1007/BF01762129MaRDI QIDQ1105385zbMATH OpenOpenAlexFDO

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

Recommendations

• scientific article; zbMATH DE number 177842
• Exact algorithms for maximum induced matching
• scientific article; zbMATH DE number 4078356
• An improved exact algorithm for maximum induced matching
• An Improved Parameterized Algorithm for a Generalized Matching Problem
• An optimal parallel algorithm for maximal matching
• Optimal general matchings
• Maximum matchings in general graphs through randomization

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
• A linear-time algorithm for a special case of disjoint set union
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Efficiency of a Good But Not Linear Set Union Algorithm
• Graph theory with applications
• Optimal Sequencing of Two Equivalent Processors
• Paths, Trees, and Flowers
• TWO THEOREMS IN GRAPH THEORY
• The general maximum matching algorithm of Micali and Vazirani

Cited in

(10)

• An efficient distributed algorithm for maximum matching in general graphs
• scientific article; zbMATH DE number 4116586 (Why is no real title available?)
• The general maximum matching algorithm of Micali and Vazirani
• An algorithm for computing simple \(k\)-factors
• Mining posets from linear orders.
• Three-quarter approximation for the number of unused colors in graph coloring
• Graph factors and factorization: 1985--2003: a survey
• Affine-invariant strictly cyclic Steiner quadruple systems
• On adaptive algorithms for maximum matching
• scientific article; zbMATH DE number 6917125 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105385)