Minimum Cut on Data Structure and Algorithms related Questions and Answers


Question :   ___________ is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge.
1. Minimum cut
2. Maximum flow
3. Maximum cut
4. Graph cut
Answer :   1 - Minimum cut  

* 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