Min-Cut o Max-Flow in a graph?
8 Sep
2004
8 Sep
'04
6:52 a.m.
Hi, How can I find the min-cut, or the max-flow in a graph with all the costs of edges equal one? Thanks Daniele
7506
Age (days ago)
7506
Last active (days ago)
0 comments
1 participants
participants (1)
-
Daniele Carlucci