Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
AlgorithmAndrew V. GoldbergApproximate max-flow min-cut theoremBarrier resilience

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
A Two-Stage Correlation Method for Stereoscopic Depth Estimation
The computation of stereoscopic depth is an important field of computer vision. Although a large variety of algorithms has been… 
Highly Cited
2009
Highly Cited
2009
Real-Time Dense and Accurate Parallel Optical Flow using CUDA
ABSTRACTA large number of processes in computer vision are based on the image motion measurement, which is the projection of… 
Highly Cited
2008
Highly Cited
2008
Online, self-supervised terrain classification via discriminatively trained submodular Markov random fields
The authors present a novel approach to the task of autonomous terrain classification based on structured prediction. We consider… 
Highly Cited
2006
Highly Cited
2006
Automatic Image Segmentation by Positioning a Seed
We present a method that automatically partitions a single image into non-overlapping regions coherent in texture and colour. An… 
Highly Cited
2002
Highly Cited
2002
A new algorithm for power distribution system planning
Highly Cited
1996
Highly Cited
1996
Decision support for airline system operations control and irregular operations
Highly Cited
1992
Highly Cited
1992
Optimal Task Assignment in Linear Array Networks
The problem of assigning tasks to the processors of a distributed computing system such that the sum of execution and… 
Highly Cited
1989
Highly Cited
1989
Faster Local Power Flow Solutions: The Zero Mismatch Approach
It is shown that faster and highly localized power flow solutions can be obtained by exploring the difference in convergence rate… 
Highly Cited
1986
Highly Cited
1986
Distributed relaxation methods for linear network flow problems
We consider distributed solution of the classical linear minimum cost network flow problem. We formulate a dual problem which is… 
Highly Cited
1982
Highly Cited
1982
A network flow approach to reconstruction of the left ventricle from two projections
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)