Hello! I have encountered a problem that boils down to finding maximum matching on a graph that unfortunately is not bipartite. Fortunately though, I observed that the complementary graph is! Is it possible to find maximum matching in polytime on such a graph? I can unfortunately not link the problem.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 21:35:08 (j2).
Desktop version, switch to mobile version.
Supported by
I solved it myself. If the complementary graph is bipartite the original graph is basically $$${2}$$$ complete subgraphs with some edges between them. Let $$${N}$$$ be the number of nodes. If $$${N}$$$ is odd the answer is $$${{N}{-}{N}{mod}{2}}$$$. If the $$${2}$$$ subgraphs have any edges between them then the answer is $$${N}$$$. Else it depends whether or not both components have odd number of nodes, or both have even number. In the first case the answer is $$${{N}{-}{2}}$$$, in the latter it's $$${N}$$$. Thing is I made a mistake and the original problem doesn't actually boil down to this so this blog is pointless