The general maximum matching algorithm of Micali and Vazirani
From MaRDI portal
Publication:1105385
DOI10.1007/BF01762129zbMATH Open0648.68077OpenAlexW2066511816MaRDI QIDQ1105385FDOQ1105385
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
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- Graph theory with applications
- Title not available (Why is that?)
- Efficiency of a Good But Not Linear Set Union Algorithm
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A linear-time algorithm for a special case of disjoint set union
- TWO THEOREMS IN GRAPH THEORY
- Optimal Sequencing of Two Equivalent Processors
- The general maximum matching algorithm of Micali and Vazirani
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Title not available (Why is that?)
- A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
Cited In (10)
- An efficient distributed algorithm for maximum matching in general graphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
