The discovery of Sybil group boils down to max-flow/min-cut problem, introduces virtual node and uses a crawler to find Sybil group.
将Sybil攻击团体的发现归结为最大流/最小割问题，引入虚拟节点并利用爬行器找到Sybil攻击团体。
参考来源 - P2P网络中Sybil攻击的防御机制The traditional networks transmit information in a store-and-forward manner. Unfortunately, the coding rate cannot achieve the max-flow bound.
传统的网络信息流传输方式是存储转发,但通常无法达到通信的最大流界。
参考来源 - 与经典信道相关的网络编码·2,447,543篇论文数据，部分数据来源于NoteExpress
The famous max-flow min-cut theorem determines the maximum throughput of a network.
最大流最小割定理决定了网络的最大吞吐量。
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
应用推荐