Skip to search formSkip to main contentSkip to account menu

Edmonds–Karp algorithm

Known as: Edmonds-Karp, Edmonds–Karp, Edmonds karp 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We consider a distributed edge computing system where we have a number of interconnected machines with limited communication… 
2016
2016
We present a formalization of the Ford-Fulkerson method for computing the maximum flow in a network. Our formal proof closely… 
Review
2016
Review
2016
This state of the art discusses the problem of reliability estimation for highly reliable stochastic flow networks. There are… 
2016
2016
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm… 
2015
2015
Motivated by Bland's linear programming (LP) generalization of the renowned Edmonds--Karp efficient refinement of the Ford… 
2015
2015
Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment… 
2006
2006
Title of dissertation: STRUCTURAL SYNTHESIS AND ANALYSIS OF PLANAR AND SPATIAL MECHANISMS SATISFYING GRUEBLER’S DEGREES OF… 
Highly Cited
1988
Highly Cited
1988
  • J. Orlin
  • Symposium on the Theory of Computing
  • 1988
  • Corpus ID: 1456411
We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp… 
1986
1986
Recently, É. Tardos gave a strongly polynomial algorithm for the minimum-cost circulation problem and solved the open problem… 
1972
1972
EDMONDS AND KARP PROPOSED AN ALGORITHM FOR FINDING THE MAXIMAL FLOW IN A NETWORK. SIMULTANEOUSLY THEY FOUND AN UPPER BOUND ON THE…