Maximum flow problem

Known as: Max flow problem, Max flow, Maximum flow 
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum. The… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
We introduce the pseudoflow algorithm for the maximum flow problem that employs only pseudoflows and does not generate flows… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum-ow… (More)
  • figure 5
  • figure 9
  • figure 11
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We study efficient implementations of the push—relabel method for the maximum flow problem. The resulting codes are faster than… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1992
Highly Cited
1992
We describe a deterministic version of a 1990 Cheriyan, Hagerup, and Mehlhorn randomized algorithm for computing the maximum flow… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a… (More)
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… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1972
Highly Cited
1972
This paper presents new algori thms for the maximum flow problem, the Hitchcock t r anspo r t a t i on problem, and the general… (More)
  • figure 1
Is this relevant?
Highly Cited
1956
Highly Cited
1956
-This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?