- Category:
- matlab
- Tags:
-
- File Size:
- 4kb
- Update:
- 2018-06-18
- Downloads:
- 0 Times
- Uploaded by:
- throne1
Description: If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 最大二分配法\get_augument_chain.m | 796 | 2018-06-04
|
| 最大二分配法\get_Gf.m | 245 | 2018-06-02
|
| 最大二分配法\Max_Bipartite_Matching.m | 1205 | 2018-06-10
|
| 最大二分配法\m_grPlot.m | 7721 | 2018-05-23
|
| 最大二分配法\m_transMatrix.m | 301 | 2018-05-23
|
| 最大二分配法 | 0 | 2018-06-10 |
Download