摘要
利用网络单位流量及网络可行流的流量平衡关系,得出流量关系矩阵,由流量关系矩阵,得出网络割矩阵,从而求出网络图的割集,最后根据网络最大流等于最小割容量,求得网络最大流,此方法使得计算网络最大流变得简便,且具有很强的实用性.
Cutting\|sets are got through the matrix of the relationships of flows, which acquired with using the flows equilibrium relationships of the one unite in the network. Therefore, the maximum flow in the network is taken by use of that it equals to the minimum capacity of cutting\|sets. The way of the algorithm in the paper is not only simpler but also more practicality than the other algorithm's.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2003年第9期125-128,共4页
Systems Engineering-Theory & Practice
基金
国家教育部博士学科点科研基金(20020287001)
南京航空航天大学特聘教授科研创新基金(1009-260812)
关键词
网络最大流
流量
流量关系矩阵
最小割
the maximum flows
flows
the matrix of the relationships of flows
the minimum cutting-sets
