Minimum Cost Maximum Independent Set in Bipartite Graph

Revision en1, by kacif42316, 2021-05-11 13:18:43

Hello, I want to find the solution to the problem, where you are given a bipartite graph with n vertices in both the set and n^2 undirected edges with some weight. how to find the minimum cost such that every vertex from both sets is in exactly one pair?

n<=200

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English kacif42316 2021-05-11 13:18:43 319 Initial revision (published)