_____________ is a family of combinatorial optimization problems in which a graph is partitioned into two or more parts with constraints.
(a) numerical problems
(b) graph partition
(c) network problems
(d) combinatorial problems
The question was asked in semester exam.
Enquiry is from Minimum Cut in division Minimum Cut of Data Structures & Algorithms II