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.
This is a straightforward problem to explain and yet I’m having some tough time on figuring out a solution. My favorite kind!
Let G=(V,E) be a bipartite graph. I need to compute the minimum subset V’ such that for every edge e=(u,v), u belong to V’ OR v belong to V’.
If there is more than one solution, anyone is acceptable.
|V| <= 2000
|E| <= 10000
Any hint could be useful 😀
Konig’s theorem is relevant.