I'm studying Edmond's maximum matching algorithm and will write the code of this algorithm. Does anyone know where to verify?
№ | Пользователь | Рейтинг |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
I'm studying Edmond's maximum matching algorithm and will write the code of this algorithm. Does anyone know where to verify?
Название |
---|
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.me/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! :)