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… 
2009
2009
A new augmenting path based algorithm called draining algorithm is proposed for the maximum flow problem in this letter. Unlike… 
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
2006
Highly Cited
2006
We present a method that automatically partitions a single image into non-overlapping regions coherent in texture and colour. An… 
Highly Cited
2005
Highly Cited
2005
In this article, we study the modulation of intensity matrices arising in cancer radiation therapy using multileaf collimators… 
Highly Cited
2005
Highly Cited
2005
As the complexity of Systems-on-Chip (SoC) is growing, meeting real-time requirements is becoming increasingly difficult… 
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…