DocumentCode
3387371
Title
An improved algorithm for maximum flow problem
Author
Deng, Guoqiang ; Tang, Min ; Chen, Guangxi
Author_Institution
Sch. of Math. & Comput. Sci., GuiLin Univ. of Electron. Technol., Guilin, China
fYear
2009
fDate
23-25 July 2009
Firstpage
591
Lastpage
594
Abstract
This article covers a problem that often arises in real life situations - the maximum flow problem. Ford-Fulkerson algorithm is very old, but very simple. The stochastic characteristic to choose the augmenting path may lead to too much iterative times. We present an improved algorithm in flow network area. Numerical experiments prove that the new algorithm is more effectiveness than the Ford-Fulkerson algorithm in some cases.
Keywords
computational complexity; flow graphs; iterative methods; network theory (graphs); optimisation; stochastic processes; Ford-Fulkerson algorithm; computational complexity; directed graph; iterative method; maximum flow network problem; stochastic characteristic; Circuits; Graph theory; Iterative algorithms; Mathematics; Roads; Runtime; Stochastic processes; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems, 2009. ICCCAS 2009. International Conference on
Conference_Location
Milpitas, CA
Print_ISBN
978-1-4244-4886-9
Electronic_ISBN
978-1-4244-4888-3
Type
conf
DOI
10.1109/ICCCAS.2009.5250448
Filename
5250448
Link To Document