How to find min-cut?
3 Sep
2004
3 Sep
'04
4:56 p.m.
Hi, How can I find the min-cut (max-flow) in a graph undirected with all the weights of the edges equal one. Thanks Daniele
7477
Age (days ago)
7477
Last active (days ago)
0 comments
1 participants
participants (1)
-
Daniele Carlucci