Maximum Matching in polytime on special kinds of graphs

Revision en1, by AlexArdelean, 2020-12-27 20:51:13

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 complement graph is! Is it possible to find maximum matching in polytime on such a graph? I can unfortunately not link the problem.

Tags matchings, polytime

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English AlexArdelean 2020-12-27 20:53:37 3 Tiny change: 'complement graph](ht' -> 'complementary graph](ht'
en2 English AlexArdelean 2020-12-27 20:53:14 50
en1 English AlexArdelean 2020-12-27 20:51:13 354 Initial revision (published)