摘要
从对通路的先后堵塞观点出发，给出了若干定理，从而构造了一对点之间的最大流算法，并讨论了算法的复杂度。
Based on the blocking principle, an algorithm for the maximum flow problem between two nodes in network is introduced in this paper. Several propositions are presented, and algorithm complexity is discussed.
出处
《南京邮电学院学报》
1997年第4期170-172,共3页
Journal of Nanjing University of Posts and Telecommunications(Natural Science)
关键词
图论
网络流
最大流
Graph theory, Network flow, Maximum flow
