MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the running time of Karger s algorithm to find the minimum cut in a graph? |
| A. | O(E) |
| B. | O(|V|<sup>2</sup>) |
| C. | O(V) |
| D. | O(|E|) |
| Answer» C. O(V) | |