Topic List

 Sorting  Dynamic Programming  Recursion  Binary Trees  Abstract Data Types  Graph  Searching  Heap  Trees  Hash Tables  Stacks  Cryptography  Number Theory  Shortest Path  Graph Search  Arrays  Algorithms  Computational Geometry  Miscellaneous  Complexity Classes  Matching  Backtracking  Trie  Bipartite Graphs  Lists  Flow Problem  B-Trees  String Matching  Minimum Cut

Minimum Cut on Data Structure and Algorithms related Questions and Answers - Page 2

Question 11 : 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|)
View Answer   Discuss with Members

Question 12 : Minimum cut algorithm comes along with the maximum flow problem.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 13 : _____________ 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
View Answer   Discuss with Members


View 11 - 13 of 13 Questions

* 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