# Maximum flow problem

## Papers overview

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

Highly Cited

2008

Highly Cited

2008

- Operations Research
- 2008

We introduce the pseudoflow algorithm for the maximum flow problem that employs only pseudoflows and does not generate flowsâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Trans. Pattern Anal. Mach. Intell.
- 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

- ICCV
- 1998

This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum-owâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Algorithmica
- 1997

We study efficient implementations of the pushâ€”relabel method for the maximum flow problem. The resulting codes are faster thanâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Circulation
- 1993

BACKGROUND
Severity of coronary artery stenosis has been defined in terms of geometric dimensions, pressure gradient-flowâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- J. Algorithms
- 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

- SIAM J. Comput.
- 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

- STOC
- 1988

We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karpâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- J. ACM
- 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)

Is this relevant?

Highly Cited

1956

Highly Cited

1956

- IRE Trans. Information Theory
- 1956

-This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists ofâ€¦Â (More)

Is this relevant?