| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
How can i find maximum perfect matching in a bipartite graph?
it can be a a sub-graph of main bipartite graph? sub-graph contains a subset of vertex from left side and a subset of vertex from right side. if we take a vertex, each vertex that shares a edge with the selected vertex must be present in the subset of vertex too.
Thanks in Advance ^_^
Wrong solution
Just take the maximum matching and remove all unmatched vertices. proof: let's say the maximum matching is n and there is a subset with a perfect matching of m and m > n then this is a contradiction since this subset can be matched in the original graph.
Can you share the link to the problem pls?
link
sorry i think did not explain the statement properly or did not understand your solution.
in my defense i can`t remove all the unmatched vertices as there might be a edge between matched and unmatched vertices!!' for example take a graph where number of node in left side is 1 and right side is 2 and the edges are
l1->r1
l1->r2
max matching is 1. suppose chosen edge is l1 r1 but here i can`t remove r2 as there is a edge between l1 and r2
sorry misunderstood the problem
Can the Edmonds Blossom algorithm be used here?
I guess you can wait till 11th May :P