I want to know how calculate Min Vertex Cover and Max Matching in any Bipartite Graph
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 159 |
5 | nor | 155 |
6 | maroonrk | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I want to know how calculate Min Vertex Cover and Max Matching in any Bipartite Graph
Name |
---|
Wikipedia to the rescue: https://en.wikipedia.org/wiki/K%C5%91nig%27s_theorem_(graph_theory) and https://en.wikipedia.org/wiki/Matching_(graph_theory) here there are explanations to the algorithms your need.. You only have to code it..