Matching Algorithms
The same group on the Doxygen site.
- group Matching Algorithms
Algorithms for finding matchings in graphs and bipartite graphs.
This group contains the algorithms for calculating matchings in graphs and bipartite graphs. The general matching problem is finding a subset of the edges for which each node has at most one incident edge.
There are several different algorithms for calculate matchings in graphs. The matching problems in bipartite graphs are generally easier than in general graphs. The goal of the matching optimization can be finding maximum cardinality, maximum weight or minimum cost matching. The search can be constrained to find perfect or maximum cardinality matching.
The matching algorithms implemented in LEMON:
HopcroftKarp Hopcroft-Karp augmenting path algorithm for calculating maximum cardinality matching in bipartite graphs.
MinCostAssignment Successive shortest path algorithm for calculating a minimum cost matching that covers the red nodes of a bipartite graph.
MaxMatching Edmond’s blossom shrinking algorithm for calculating maximum cardinality matching in general graphs.
MaxWeightedMatching Edmond’s blossom shrinking algorithm for calculating maximum weighted matching in general graphs.
MaxWeightedPerfectMatching Edmond’s blossom shrinking algorithm for calculating maximum weighted perfect matching in general graphs.
MaxFractionalMatching Push-relabel algorithm for calculating maximum cardinality fractional matching in general graphs.
MaxWeightedFractionalMatching Augmenting path algorithm for calculating maximum weighted fractional matching in general graphs.
MaxWeightedPerfectFractionalMatching Augmenting path algorithm for calculating maximum weighted perfect fractional matching in general graphs.

Classes
Class |
Description |
|---|---|
Maximum cardinality matching in bipartite graphs. |
|
Minimum cost assignment in bipartite graphs. |
|
Max cardinality fractional matching. |
|
Weighted fractional matching in general graphs. |
|
Weighted fractional perfect matching in general graphs. |
|
Maximum cardinality matching in general graphs. |
|
Weighted matching in general graphs. |
|
Weighted perfect matching in general graphs. |
Other classes of its headers
Class |
Description |
|---|---|
Default traits class of MaxFractionalMatching class. |