| 网络最大流求解算法的研究 |
| |
| 引用本文： | 孙泽宇,丁国强,程志谦. 网络最大流求解算法的研究[J]. 微计算机信息, 2010, 0(3) |
| |
| 作者姓名： | 孙泽宇 丁国强 程志谦 |
| |
| 作者单位： | 洛阳理工学院计算机与信息工程系; |
| |
| 摘 要： | 近年来,随着各种网络的飞速发展,对最大流问题的研究也取得了很大的进展。文章简述了网络最大流问题的现状,提出了一种求解网络最大流与最小截问题的算法。此算法使得计算网络最大流变得简便,且具有很强的实用性。
|
| 关 键 词： | 网络最大流 算法 最大流问题 最小截 |
Research on the Algorithm for the Solution to the Maximum Network Flow Problem |
| |
| SUN Ze-yu DING Guo-qiang CHENG Zhi-qian. Research on the Algorithm for the Solution to the Maximum Network Flow Problem[J]. Control & Automation, 2010, 0(3) |
| |
| Authors: | SUN Ze-yu DING Guo-qiang CHENG Zhi-qian |
| |
| Affiliation: | SUN Ze-yu DING Guo-qiang CHENG Zhi-qian(Luoyang Institute of Science , Technology Computer , Information Engineering Department Luoyang 471023,China) |
| |
| Abstract: | Recently,with the rapid development of various networks,the research on the maximum flow problem has made remarkable achievements.In this article,the condition of the maximum flow problem is proposed and presents a algorithm for the solution to the maximum flow problem of networks and minimum cut.The way of the algorithm in the paper is not only simpler but also more practi cality than the other algorithm's. |
| |
| Keywords: | The maximum flows Algorithm Maximum flow problem The minimum cut |
| 本文献已被 CNKI 等数据库收录！ |
|
