# Edmonds–Karp algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

- Computer and Information Science
- 2019

Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is… Expand

Is this relevant?

2016

2016

- Archive of Formal Proofs
- 2016

We present a formalization of the Ford-Fulkerson method for computing the maximum flow in a network. Our formal proof closely… Expand

Is this relevant?

2016

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

Is this relevant?

2015

2015

- SIAM Journal on Optimization
- 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

- IEEE 19th International Conference on Computer…
- 2015

In the model of partnership formation, every agent is in hot pursuit of maximizing his own utility. Doft Talman and Zaifu Yang… Expand

Is this relevant?

2013

2013

- 2013

Maximum flow problem is a fundamental network flow problem which involves finding a feasible and optimal flow in network… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Operations Research
- 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

- Math. Program.
- 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

- 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

Is this relevant?

1972

1972

- J. ACM
- 1972

EDMONDS AND KARP PROPOSED AN ALGORITHM FOR FINDING THE MAXIMAL FLOW IN A NETWORK. SIMULTANEOUSLY THEY FOUND AN UPPER BOUND ON THE… Expand

Is this relevant?