KnowraEdmonds–Karp algorithmLinked fromLinked fromThe 7 pages that link to Edmonds–Karp algorithm, each with the reason it gives.All 7Broader topic 6Compared with 1Augmenting pathBroader topic: It specifies a systematic rule for selecting augmenting paths.Maximum flow problemBroader topic: Its path-selection rule gives a polynomial-time implementation of Ford–Fulkerson.Residual graphBroader topic: Its repeated searches are performed on residual graphs.Ford–Fulkerson algorithmBroader topic: It is Ford–Fulkerson with a specific path rule and a polynomial-time bound.Max-flow min-cut theoremBroader topic: It uses the theorem's maximum-flow certificate and runs in polynomial time.Richard M. KarpBroader topic: Its name records Karp’s collaboration with Jack Edmonds on a practical flow method.