Open In App

UGC-NET | UGC NET CS 2018 July – II | Question 81

Like Article
Like
Save
Share
Report

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


Last Updated : 10 Sep, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads