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攻击的防御机制·2,447,543篇论文数据，部分数据来源于NoteExpress
The famous max-flow min-cut theorem determines the maximum throughput of a network.
最大流最小割定理决定了网络的最大吞吐量。
Failure rate and average repair time of input-bus unit were calculated by state Spaces method. Power reliability indices of whole systems were computed by min-cut method.
该方法用状态空间法求解输入母线单元失效频率和平均修复时间，用最小割集法计算整个系统的供电可靠性指标。
Nearby is the colossal 12th-century Sitting Buddha 120 m. high. It is cut of the rock face overlooking the Min River.
附近一尊巨大的12世纪的坐佛，120米高。它是由一块俯瞰岷江的岩石雕刻而成。
应用推荐