Because the improved algorithm involves the knowledge of the maximal flow problem, this paper also addressed discovering community method based on maximal flow and the symbol algorithm.
由于改进算法涉及到了最大流问题方面的内容，本文也对社区发现中基于最大流的社区发现方法及标号算法进行了讨论。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
On the algorithm of the network maximal flow, the paper provides a method of achieving it.
针对网络最大流的计算问题，提出了一种网络最大流计算模型的实现方法。
On the algorithm of the network maximal flow, the paper provides a method of achieving it.
针对网络最大流的计算问题，提出了一种网络最大流计算模型的实现方法。
应用推荐