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 | 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 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/05/2024 01:34:51 (k2).
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