论文部分内容阅读
本文建立了k度薄弱最小割集概念,以表征网络传输薄弱环节薄弱的程度。在此基础上提出了一种搜索大型网络k度薄弱最小割集的算法。计算复杂性分析表明,该算法的计算频度较低,可有效应用于大型网络传输容量充足度分析之中。
In this paper, the concept of k-degree weak minimum cut set is established to characterize the weakness of weak links in network transmission. On this basis, an algorithm for searching k-degree weak minimum cut sets in large-scale networks is proposed. Computational complexity analysis shows that the proposed algorithm is less computationally efficient and can be effectively applied to the analysis of large network transmission capacity adequacy.