Need help with a problem

Revision en1, by Excogitatoris, 2019-04-16 07:31:47

I have an undirected bipartite graph with N nodes in set A and M nodes in set B, where N <= 50000 and M <= 1000. There can be N * M edges. Each node from set A can mark either zero or two nodes from set B if there is an edge between the node from set A and each of the two nodes from set B. Each node from set B can be marked only once by only one node from set A. I need to find the maximum number of nodes that can be marked from set B.

I'm stuck with this problem. Any kind of help is very much appreciated.


  Rev. Lang. By When Δ Comment
en1 English Excogitatoris 2019-04-16 07:31:47 537 Initial revision (published)