338 views

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 \: (E^2*f)$
3. $O \: (E*f^2)$
4. $O \: (E^2*f^2)$
in Others
retagged | 338 views