A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs

DOI10.1007/BF02239502zbMath0278.65069MaRDI QIDQ1394096

D. Massart

Publication date: 1974

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Formal languages and automata (68Q45)

Related Items (7)

The general maximum matching algorithm of Micali and Vazirani ⋮ Maximum 0-1 timed matching on temporal graphs ⋮ Degree switching operations in networks and large scale systems assignment problems ⋮ An efficient distributed algorithm for maximum matching in general graphs ⋮ Unnamed Item ⋮ Efficient recognition of equimatchable graphs ⋮ A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm

Cites Work

• TWO THEOREMS IN GRAPH THEORY
• Paths, Trees, and Flowers
• Modification of Edmonds' maximum matching algorithm
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item

This page was built for publication: A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs