81. E is the number of edges in the graph and f is maximum flow in the graph. When the
capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :
(1) O (E∗f) (2) O (E2∗f)capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :
(3) O (E∗f2) (4) O (E2∗f2)
Answer:
| Previous | Next |
| UGC NET CS 2018 July - II Question 80 | UGC NET CS 2018 July - II Question 82 |
No comments:
Post a Comment