I'm studying Edmond's maximum matching algorithm and will write the code of this algorithm. Does anyone know where to verify?
# | User | Rating |
---|---|---|
1 | tourist | 3671 |
2 | jiangly | 3653 |
3 | Um_nik | 3629 |
4 | Benq | 3513 |
5 | ksun48 | 3486 |
6 | MiracleFaFa | 3466 |
7 | slime | 3452 |
8 | maroonrk | 3422 |
9 | Radewoosh | 3406 |
10 | greenheadstrange | 3393 |
# | User | Contrib. |
---|---|---|
1 | awoo | 188 |
2 | -is-this-fft- | 186 |
3 | YouKn0wWho | 182 |
4 | Um_nik | 180 |
5 | Monogon | 178 |
6 | antontrygubO_o | 171 |
7 | maroonrk | 165 |
8 | adamant | 164 |
9 | SlavicG | 163 |
9 | SecondThread | 163 |
I'm studying Edmond's maximum matching algorithm and will write the code of this algorithm. Does anyone know where to verify?
Name |
---|
http://acm.timus.ru/problem.aspx?space=1&num=1099
Thank you very much!
This problem.
Good day to you,
I've collected a few problems, in which I used Max-matching (HK) so here is mine list
http://www.lightoj.com/volume_showproblem.php?problem=1171
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4851
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=657&page=show_problem&problem=4899
http://codeforces.com/gym/100820 /*PROBLEM A — Airport*/
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=441&page=show_problem&problem=3975
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4696
https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2079
http://www.spoj.com/problems/MATCHING/
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3235
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=602&page=show_problem&problem=4406
http://www.spoj.com/problems/ADAPATH/
http://www.spoj.com/problems/ADACITY/
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=441&page=show_problem&problem=3994
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3642
Hope it will help {and hope I didn't make any mistake in collecting}!
Good Luck & Have nice day
I think he means matching in general graph. It is O(N^3) as far as I know and might be too slow for some of the problems which you have solved with HK.
Edit: Okay, he means Edmond's algorithm. At least this is O(N^3), right? :D
there are couple of
matching algorithms. For example, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.2804&rep=rep1&type=pdf
Wow, thank you! :)