Q198
What is the running time of Karger's algorithm to find the minimum cut in a graph?
A.
O(E)
B.
O(|V|2)
AnswerC.
O(V)
D.
O(|E|)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board