11419 - SAM I AM

[898989]

is not the graph so large?!
Can you describe your graph construction?

[emotional blind]

Number of nodes = number of row + number of column + 2

here I used 1 dummy source and one dummy sink.

[898989]

hmmm

Is not 1000+1000+2 is large?

my idea ( min vertex cover ) is the following graph
Left side (1000 node for ROWs & 1000 node for Cols)
Right Side (each node in the grid)
Draw arcs between lfet to right if left (row/col) covers a node.

This is too much....Can you elaborate in some detaisl how u construct ur graph?

[emotional blind]

My graph is same as yours.

[mak(cse_DU)]

WooW.
It is a nice minimum vertex cover problem for bipartite graph.
Thanks Jan vaia.

[shiam]

My graph is same as yours.

can you please elaborate what have you done ? The min cut is not always indicating the correct nodes.

[double_zero]

Hello guys, I have some problems with min vertex cover on bipartite graph.

I know that the "max cardinality bipartite matching" equals the number of vertices in "min vertex cover of graph", but how we print those vertices belong to min vertex cover???