___________ is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge.
Posted: Wed Jul 13, 2022 6:16 pm
a) Minimum cut
b) Maximum flow
c) Maximum cut
d) Graph cut
b) Maximum flow
c) Maximum cut
d) Graph cut