Edmonds–Karp algorithm
Algorithm
In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time. The algorithm was first published by Yefim Dinitz in 1970, and independently published by Jack Edmonds and Richard Karp in 1972.
Nº Q1302658 ★
Common · Knowledge
Edmonds–Karp algorithm
Algorithm
In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time. The algorithm was first published by Yefim Dinitz in 1970, and independently published by Jack Edmonds and Richard Karp in 1972.
From Wikipedia
In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time. The algorithm was first published by Yefim Dinitz in 1970, and independently published by Jack Edmonds and Richard Karp in 1972. Dinitz's algorithm includes additional techniques that reduce the running time to O ( | V | 2 | E | ) {\displaystyle O(|V|^{2}|E|)} .
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Ford–Fulkerson algorithm
Algorithm
Nº Q284695 ★
Not listed
-
C
Coppersmith–Winograd algorithm
Algorithm for matrix multiplication
Nº Q2835794 ★
Not listed
-
Shortest path problem
Problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Nº Q1058754 ★★
Not listed
-
B
Blossom algorithm
Algorithm for constructing maximum matchings on a graph
Nº Q1030529 ★
Not listed
-
Kruskal's algorithm
Minimum spanning forest algorithm that greedily adds edges
Nº Q797860 ★★
Not listed
-
FROG
Block cipher
Nº Q3063412 ★
Not listed