Edmonds–Karp 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 time. The algorithm was first published by Yefim Dinitz (whose name is also transliterated "E. A. Dinic", notably as author of his early papers) in 1970 and independently published by Jack Edmonds and Richard Karp in 1972. Dinic's algorithm includes additional techniques that reduce the running time to .
known for
Circulation problemCut (graph theory)Dinic's algorithmEdmonds-KarpEdmonds-Karp algorithmEdmonds KarpEdmonds karpEdmonds–KarpFlow networkFord–Fulkerson algorithmGrabCutGraph cut optimizationGraph theoryHopcroft–Karp algorithmJack EdmondsList of algorithmsMax-flow min-cut theoremMaximum flow problemNetwork flow problemPush–relabel maximum flow algorithmQuadratic pseudo-Boolean optimizationRichard M. KarpTimeline of algorithmsWidest path problem
Link from a Wikipage to another Wikipage
known for
primaryTopic
Edmonds–Karp 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 time. The algorithm was first published by Yefim Dinitz (whose name is also transliterated "E. A. Dinic", notably as author of his early papers) in 1970 and independently published by Jack Edmonds and Richard Karp in 1972. Dinic's algorithm includes additional techniques that reduce the running time to .
has abstract
Algorytm Edmondsa-Karpa jest j ...... ię obecnie algorytmem Dynica).
@pl
Edmondsův-Karpův algoritmus je ...... edukují časovou složitost na .
@cs
En ciencias de la computación ...... ducir la complejidad a O(V2E).
@es
En informatique et en théorie ...... le temps de calcul à O(V2 E).
@fr
En informàtica i teoria de gra ...... reduir el temps d'execució a .
@ca
In computer science, the Edmon ...... t reduce the running time to .
@en
Na Ciência da computação e teo ...... uzir o tempo para a ordem de .
@pt
Алгоритм Едмондса — Карпа розв ...... ідходи для зменшення часу до .
@uk
Алгоритм Эдмондса — Карпа реша ...... имо открыт Эдмондсом и Карпом.
@ru
エドモンズ・カープのアルゴリズム(英: Edmonds-Ka ...... リズムには追加の技法が含まれており、計算量は となっている。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,843,887
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Algorytm Edmondsa-Karpa jest j ...... czególnie dla grafów rzadkich.
@pl
Edmondsův-Karpův algoritmus je ...... edukují časovou složitost na .
@cs
En ciencias de la computación ...... ducir la complejidad a O(V2E).
@es
En informatique et en théorie ...... le temps de calcul à O(V2 E).
@fr
En informàtica i teoria de gra ...... reduir el temps d'execució a .
@ca
In computer science, the Edmon ...... t reduce the running time to .
@en
Na Ciência da computação e teo ...... uzir o tempo para a ordem de .
@pt
Алгоритм Едмондса — Карпа розв ...... ідходи для зменшення часу до .
@uk
Алгоритм Эдмондса — Карпа реша ...... имо открыт Эдмондсом и Карпом.
@ru
エドモンズ・カープのアルゴリズム(英: Edmonds-Ka ...... リズムには追加の技法が含まれており、計算量は となっている。
@ja
label
Algorisme Edmonds-Karp
@ca
Algorithme d'Edmonds-Karp
@fr
Algorithmus von Edmonds und Karp
@de
Algoritmo de Edmonds-Karp
@es
Algoritmo de Edmonds-Karp
@pt
Algorytm Edmondsa-Karpa
@pl
Edmondsův–Karpův algoritmus
@cs
Edmonds–Karp algorithm
@en
Алгоритм Едмондса — Карпа
@uk
Алгоритм Эдмондса — Карпа
@ru