Minimum Cut on Data Structure and Algorithms related Questions and Answers


Question :   What is the running time of implementing a min-cut algorithm using bidirected edges in a graph?
1. O(N)
2. O(N log N)
3. O(N4)
4. O(N2)
Answer :   3 - O(N4)  

* 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