UGC-NET | UGC NET CS 2018 July – II | Question 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 :
(A) O (E∗f)
(B) O (E2 ∗f)
(C) O (E∗f2 )
(D) O (E2 ∗f2 )


Answer: (A)

Explanation:

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.