I want to know how calculate Min Vertex Cover and Max Matching in any Bipartite Graph
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
9 | awoo | 153 |
10 | luogu_official | 152 |
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..