I read the book Algorithm Design, chapter 1, it gave a very short description of how to convert Bipartite Matching to Independent Set Problem and I don’t get it.
Do anybody know that any detailed matriel to describe this process? Thanks!
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I read the book Algorithm Design, chapter 1, it gave a very short description of how to convert Bipartite Matching to Independent Set Problem and I don’t get it.
Do anybody know that any detailed matriel to describe this process? Thanks!
A maximum bipartite matching is a set of edges in a bipartite graph, no two edges being adjacent. A maximum independent set is a set of nodes (vertices) in a graph, no two vertices being adjacent.
So, you can convert a bipartite matching problem to independent set by converting every edge in your bipartite graph to a node, and then add an edge between all those newly created nodes that share a common endpoint in the original graph. Then a maximum independent set in the new graph corresponds to a maximum bipartite matching in the original problem.