Minimum Cut on Data Structure and Algorithms related Questions and Answers


Question :   What is the running time of Karger's algorithm to find the minimum cut in a graph?
1. O(E)
2. O(|V|2)
3. O(V)
4. O(|E|)
Answer :   2 - O(|V|2)  

* 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