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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
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
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
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
Recently the number of distributed generators (DG) being integrated in to the distribution system has increased. The distribution… 
Highly Cited
2004
Highly Cited
2004
Measurements of Eulerian flow velocity obtained within the swash zone on a relatively steep beach face (gradient 1:23) are… 
Highly Cited
2002
Highly Cited
1989
Highly Cited
1989
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
We consider distributed solution of the classical linear minimum cost network flow problem. We formulate a dual problem which is…