An Improved Algorithm for Mazimum Flow Problem

摘要：

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.

作者: Guoqiang Deng Min Tang Guangxi Chen

作者单位: School of Mathematics & Computational Science./GuiLin University of Electronic Technology/GuiLin, GuangXi, China

会议类型: 国际会议

会议名称: 2009国际通信电路与系统学术会议(ICCCAS 2009)(2009 International Conference on Communications，Circuits and Systems)

会议地点: 成都

会议语种:英文

页码: 591-594

在线出版日期: 2009-07-23（万方平台首次上网日期，不代表论文的发表时间）