'What is the minimum number of edges that can I remove so that each node has at most one degree?

What is the minimum number of edges that can I remove from a bipartite graph (indirect) G=(V,E) so that each node has at most one degree ?

I tried to do it with define flow network (and Ford Fulkerson algorithm). But I do not know how to define the flow network in this case.

graphbipartitenetwork-flowford-fulkerson


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions