The Gateway to Computer Science Excellence
0 votes
455 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 Graph Theory by
recategorized | 455 views

1 Answer

0 votes
A is the correct answer
by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,375 questions
60,610 answers
202,045 comments
95,429 users