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 . The Wikibook Algorithm implementation has a page on the topic of: Edmonds-Karp
- Comment
- enIn 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 . The Wikibook Algorithm implementation has a page on the topic of: Edmonds-Karp
- Depiction
- Has abstract
- enIn 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 . The Wikibook Algorithm implementation has a page on the topic of: Edmonds-Karp
- Hypernym
- Implementation
- Is primary topic of
- Edmonds–Karp algorithm
- Label
- enEdmonds–Karp algorithm
- Link from a Wikipage to an external page
- web.archive.org/web/20061005083406/http:/www.cis.upenn.edu/~wilf/AlgComp3.html
- Link from a Wikipage to another Wikipage
- Augmenting path
- Big O notation
- Breadth-first search
- Category:Graph algorithms
- Category:Network flow problem
- Computer science
- Dinic's algorithm
- File:Edmonds-Karp flow example 0.svg
- File:Edmonds-Karp flow example 1.svg
- File:Edmonds-Karp flow example 2.svg
- File:Edmonds-Karp flow example 3.svg
- File:Edmonds-Karp flow example 4.svg
- Flow network
- Ford–Fulkerson algorithm
- Introduction to Algorithms
- Jack Edmonds
- Max flow min cut theorem
- Maximum flow problem
- Richard Karp
- SameAs
- Algorisme Edmonds-Karp
- Algorithme d'Edmonds-Karp
- Algorithmus von Edmonds und Karp
- Algoritmo de Edmonds-Karp
- Algoritmo de Edmonds-Karp
- Algoritmul Edmonds-Karp
- Algorytm Edmondsa-Karpa
- Edmondsův–Karpův algoritmus
- Kspz
- m.01jprl
- Q1302658
- Thuật toán Edmonds–Karp
- Алгоритм Едмондса — Карпа
- Алгоритм Эдмондса — Карпа
- Едмондс–Карпов алгоритам
- الگوریتم ادموندز کارپ
- ขั้นตอนวิธีของเอ็ดมอนด์-คาป
- エドモンズ・カープのアルゴリズム
- 埃德蒙兹-卡普算法
- Subject
- Category:Graph algorithms
- Category:Network flow problem
- Thumbnail
- WasDerivedFrom
- Edmonds–Karp algorithm?oldid=1082758324&ns=0
- WikiPageLength
- 7532
- Wikipage page ID
- 239230
- Wikipage revision ID
- 1082758324
- WikiPageUsesTemplate
- Template:Optimization algorithms
- Template:Reflist
- Template:Short description
- Template:Use American English
- Template:Wikibooks
