Q646
. . . . . . . . is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge.
A.
Minimum cut
AnswerB.
Maximum flow
C.
Maximum cut
D.
Graph cut
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board