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
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/05/2024 08:43:12 (j3).
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