Class 12
Class 12. The Global Min Cut problem. Global Min cut. INPUT : A network G = (N, A) OUTPUT: A cut (S, NS) such that cap(S, NS) is minimum. Note : We do not assume that there is a source node s and destination node t. Typically, but not always, the network is undirected.
479 views • 23 slides