最大流最小割定理
- 【数】maximum flow minimum cut theorem
最大流最小割定理-
最大流最小割定理决定了网络的最大吞吐量。
The famous max-flow min-cut theorem determines the maximum throughput of a network .
-
我们根据最大流最小割定理得到网络流矩阵的可用于矩阵降阶的一些性质，利用这些性质对矩阵进行降阶的时候不需要计算平衡数，在矩阵降阶的前期避免了很多运算。
According to Maximum flow Minimum cut theorem , we show for the flow matrix some properties which are useful for reducing the matrix order . According to these properties , it is unnecessary to calculate the balance number before reducing the matrix order .