Hi, I tried to understand bipartite matching from here But it was different from the normal max-flow code.(Dinics for example).What is its proof of corectness and its complexity?
Thanx
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hi, I tried to understand bipartite matching from here But it was different from the normal max-flow code.(Dinics for example).What is its proof of corectness and its complexity?
Thanx
Name |
---|
Hi! I have learnt maximum bipartite matching from those two videos:
First
Second
It's explained very well, I think its complexity is O(N^3).
For practice: http://lightoj.com/volume_showproblem.php?problem=1184 //You need a registration to see the problem.
My accepted code(it might be helpful to understand it better): http://ideone.com/lGgTXz
Thank you , that was really helpful . If you know about any nice resource for learning Hopcroft-Karp please can you share that too ?
Unfortunately, I don't know anything about Hopcroft-Karp matching. Maybe I will try to learn it this week if I find a good tutorial on it. By the way, can anyone with more experience describe it or recommend an article/video, please? :)
Can you provide some videos or article or write about it a bit on Hopcroft karp matching.