In a network flow graph where “V” is a set of vertices, “s-t cut” is defined as

Question

Answer

an s-t cut is a partitioning of V in two blocks, A and B, with s,t  ε  A and V- {s,t}  ε  B

Answer

an s-t cut is a partitioning of V in two blocks, A and B, with V  ε  B and  φ   ε  A

Answer

an s-t cut is a partitioning of V in two blocks, A and B, with V  ε  A and  φ   ε  B

Answer

an s-t cut is a partitioning of V in two blocks, A and B, with s  ε  A and t  ε  B

Crowdly