KnowraMaximum flow problemLinked fromLinked fromThe 21 pages that link to Maximum flow problem, each with the reason it gives.All 21Broader topic 1Related 9Narrower topic 6Compared with 5Augmenting pathNarrower topic: Repeated augmentation seeks this network-wide optimum.Residual graphNarrower topic: Residual paths reveal whether any additional source-to-sink flow remains possible.Ford–Fulkerson algorithmNarrower topic: Ford–Fulkerson is a general method for solving this optimization problem.Edmonds–Karp algorithmNarrower topic: The algorithm terminates with this optimization objective achieved.Max-flow min-cut theoremNarrower topic: The theorem gives an exact certificate for the optimum of this network optimization problem.Push–relabel maximum flow algorithmNarrower topic: When excess is gone, the resulting preflow is a maximum flow.