I'm looking for tutorials and good documentation about Matching in general graph, and if it's posible some problems that can be solve by this algorithm. Thank in advance?
→ Pay attention
Contest is running
2023 Post World Finals Online ICPC Challenge powered by Huawei
13 days
Register now »
2023 Post World Finals Online ICPC Challenge powered by Huawei
13 days
Register now »
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | SecondThread | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/07/2024 15:14:36 (i1).
Desktop version, switch to mobile version.
Supported by
this is the original article: http://cms.math.ca/10.4153/CJM-1965-045-4 and this post is very good in the topic: http://e-maxx.ru/algo/matching_edmonds (in russian, use google translator)
thanks