Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,237,304 papers from all fields of science
Search
Sign In
Create Free Account
Edmonds–Karp algorithm
Known as:
Edmonds-Karp
, Edmonds–Karp
, Edmonds karp
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Breadth-first search
Computer science
Cut (graph theory)
Dinic's algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Data distribution and scheduling for distributed analytics tasks
Stephen Pasteris
,
Shiqiang Wang
,
C. Makaya
,
K. Chan
,
M. Herbster
IEEE SmartWorld, Ubiquitous Intelligence…
2017
Corpus ID: 45940566
We consider a distributed edge computing system where we have a number of interconnected machines with limited communication…
Expand
2016
2016
Formalizing the Edmonds-Karp Algorithm
P. Lammich
,
S. Reza Sefidgar
International Conference on Interactive Theorem…
2016
Corpus ID: 7844629
We present a formalization of the Ford-Fulkerson method for computing the maximum flow in a network. Our formal proof closely…
Expand
Review
2016
Review
2016
Highly reliable stochastic flow network reliability estimation
H. Cancela
,
Leslie Murray
,
G. Rubino
Latin American Computing Conference / Conferencia…
2016
Corpus ID: 16909823
This state of the art discusses the problem of reliability estimation for highly reliable stochastic flow networks. There are…
Expand
2016
2016
Modified EDMONDS-KARP Algorithm to Solve Maximum Flow Problems
Kalyan Kumar Mallick
,
A. Khan
,
M. M. Ahmed
,
Md. Shamsul Arefin
,
M. Uddin
2016
Corpus ID: 30285429
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm…
Expand
2015
2015
Minimum Weight Perfect Matching via Blossom Belief Propagation
Sungsoo Ahn
,
Sejun Park
,
M. Chertkov
,
Jinwoo Shin
Neural Information Processing Systems
2015
Corpus ID: 7565889
Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment…
Expand
2003
2003
Multi-drop path model for multicast routing and wavelength assignment
Shuguang Yan
,
J. Deogun
Information Sciences
2003
Corpus ID: 32845271
1999
1999
A new scaling algorithm for the minimum cost network flow problem
D. Goldfarb
,
Zhiying Jin
Operations Research Letters
1999
Corpus ID: 42257903
1989
1989
Peripherally specified homomorphs of knot groups
Dennis Johnson
,
C. Livingston
1989
Corpus ID: 54085170
Let G be a group and let , and A be elements of G. Necessary and sufficient conditions are presented for the solution of the…
Expand
1987
1987
New distance-directed algorithms for maximum flow and parametric maximum flow problems
J. Orlin
,
R. Ahuja
1987
Corpus ID: 60596705
1972
1972
Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
Norman Zadeh
JACM
1972
Corpus ID: 14763223
EDMONDS AND KARP PROPOSED AN ALGORITHM FOR FINDING THE MAXIMAL FLOW IN A NETWORK. SIMULTANEOUSLY THEY FOUND AN UPPER BOUND ON THE…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE