摘要
根据网络系统中的连续定理和最大容量等概念,建立了求解最大流量问题的一种简捷算法。此方法改进了惯用的Ford—Fulkerson标记化方法,去掉其繁琐性,因而有更大的实用价值。
According to the continuity theorem in network system, the conception of maximal volume and etc., this paper provides a simple method to solve the maximal flow problem. The method has more extensive practicability by improving the idiomatic Ford-Fulkerson labelling algorithm and eliminating its complexity.
出处
《沈阳建筑工程学院学报》
1990年第3期37-42,共6页
Journal of Shenyang Archit Civil Eng Univ: Nat Sci
关键词
流量
极大流
网络流
maximal flows
network flows
labeling algorithm
continuity theorem
inevitably adjusted edge
possibly revised path
