recategorized
1,149 views
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

  1. $O \: (E*f)$
  2. $O \: (E^2*f)$
  3. $O \: (E*f^2)$
  4. $O \: (E^2*f^2)$
recategorized

1 Answer

Related questions

1 votes
1 votes
2 answers
1
Pooja Khatri asked Jul 13, 2018
2,655 views
The definitions in an XML document are said to be ______ when the tagging system ans definitions in the DTD are all in compliancewell-formedreasonablevalidlogical