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.
2019
2019
Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 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?
2016
2016
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 4
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
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?
2013
2013
Maximum flow problem is a fundamental network flow problem which involves finding a feasible and optimal flow in network… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
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?
1986
1986
Recently, É. Tardos gave a strongly polynomial algorithm for the minimum-cost circulation problem and solved the open problem… Expand
Is this relevant?
1983
1983
In this paper we consider the minimum cost network flow problem: min(cx : Ax = b, x 0), where A is an m x n vertex-edge incidence… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
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?