计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (19): 78-81.
• 网络、通信、安全 • 上一篇 下一篇
潘荷新1,伊崇信2,李 满2
收稿日期:
修回日期:
出版日期:
发布日期:
PAN Hexin1,YI Chongxin2,LI Man2
Received:
Revised:
Online:
Published:
摘要: 给出一种通过构造网络级连层次图的方法,来间接求出最大网络流的算法。对于给定的有n个顶点,e条边的网络N=G,s,t,C,该算法可在On2时间内快速求出流经网络N的最大网络流及达最大流时的网络流。
关键词: 网络, 级连层次图, 最大流
Abstract: This paper gives an algoritm that structures a network cascade level graph to find out maximum flow of the network indirectly.For the given network N=(G,s,t,C) that has n vetexes and e arcs,this algorithm finds out the maximum value of the network flow fast in O(n2) time that flows from the network N and the network flows when the value of the one reach maximum.
Key words: network, cascade level graph, maximum flow
潘荷新1,伊崇信2,李 满2. 级连层次图的网络最大流算法研究[J]. 计算机工程与应用, 2011, 47(19): 78-81.
PAN Hexin1,YI Chongxin2,LI Man2. Research on network maximum flows algorithm of cascade level graph[J]. Computer Engineering and Applications, 2011, 47(19): 78-81.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2011/V47/I19/78