Minimum Cut on Data Structure and Algorithms related Questions and Answers


Question :   _____________ is a family of combinatorial optimization problems in which a graph is partitioned into two or more parts with constraints.
1. numerical problems
2. graph partition
3. network problems
4. combinatorial problems
Answer :   2 - graph partition  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter