Description: For maximum matching of two partite graphs, maximum flow or Hungarian algorithm can be used.
The maximum match is given a two partite graph G. In a subgraph M of G, any two edges of the edge of the M are not attached to the same vertex, then it is called a match. The subset of the largest number of the edges of the graph is called the maximum matching problem of the graph if each vertex in the graph is associated with a certain edge in the graph. This match is called complete matching, also known as complete matching.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| Pipei.m | 1715 | 2018-06-06
|
| zjfs.m | 1446 | 2018-06-06 |
Download