Edmonds–Karp algorithm (with Richard Karp)

E1739866 UNEXPLORED

The Edmonds–Karp algorithm is a classic implementation of the Ford–Fulkerson method that computes maximum flow in a network using breadth-first search to find shortest augmenting paths.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Edmonds–Karp algorithm (with Richard Karp) canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Jack Edmonds → knownFor → Edmonds–Karp algorithm (with Richard Karp) ⓘ