0 votes 0 votes 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 $O \: (E*f)$ $O \: (E^2*f)$ $O \: (E*f^2)$ $O \: (E^2*f^2)$ Graph Theory ugcnetcse-july2018-paper2 graph-theory + – Pooja Khatri asked Jul 13, 2018 recategorized May 23, 2020 Pooja Khatri 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes A is the correct answer Anshu Kesarwani answered Nov 14, 2019 Anshu Kesarwani comment Share Follow See all 0 reply Please log in or register to add a comment.