Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
  • figure 1
  • figure 2
Is this relevant?
2016
2016
We present a formalization of the Ford-Fulkerson method for computing the maximum flow in a network. Our formal proof closely… Expand
  • figure 1
Is this relevant?
2015
2015
Motivated by Bland's linear programming (LP) generalization of the renowned Edmonds--Karp efficient refinement of the Ford… Expand
Is this relevant?
2015
2015
Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment… Expand
  • figure 1
  • figure 2
Is this relevant?
2015
2015
In the model of partnership formation, every agent is in hot pursuit of maximizing his own utility. Doft Talman and Zaifu Yang… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • J. Orlin
  • Oper. Res.
  • 1993
  • Corpus ID: 122788345
In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1986
1986
Recently, É. Tardos gave a strongly polynomial algorithm for the minimum-cost circulation problem and solved the open problem… Expand
Is this relevant?
1972
1972
EDMONDS AND KARP PROPOSED AN ALGORITHM FOR FINDING THE MAXIMAL FLOW IN A NETWORK. SIMULTANEOUSLY THEY FOUND AN UPPER BOUND ON THE… Expand
  • figure 1
Is this relevant?