Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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…

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…

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…

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…

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…