| 网络K度薄弱最小割集及其快速搜索算法 |
| |
| 引用本文： | 陈华,周家启.网络K度薄弱最小割集及其快速搜索算法[J].重庆大学学报(自然科学版),1989,12(6):55-61. |
| |
| 作者姓名： | 陈华 周家启 |
| |
| 作者单位： | 重庆大学电力系统研究所
(陈华)，重庆大学电力系统研究所(周家启) |
| |
| 摘 要： | 本文建立了k度薄弱最小割集概念,以表征网络传输薄弱环节薄弱的程度。在此基础上提出了一种搜索大型网络k度薄弱最小割集的算法。计算复杂性分析表明,该算法的计算频度较低,可有效应用于大型网络传输容量充足度分析之中。
|
| 关 键 词： | 网络分析 可靠性 最小割集 |
THE K-WEAK MINIMAL CUT SET OF NETWORKS AND FAST SEARCHING ALGORITHM |
| |
| Chen Hua Zhou Jiaqi.THE K-WEAK MINIMAL CUT SET OF NETWORKS AND FAST SEARCHING ALGORITHM[J].Journal of Chongqing University(Natural Science Edition),1989,12(6):55-61. |
| |
| Authors: | Chen Hua Zhou Jiaqi |
| |
| Institution: | Chen Hua Zhou Jiaqi |
| |
| Abstract: | A new concept dafincd as k-weak minimal cut set, which, is used to characterize the weakness of the weak link set, is established in this paper. Based on this concept, a fast algcrithm or searching k-weak minimal cut set in large scale networks is proposed. From the analysis of computation complexity, it is shown that the frequency count of the algorithm is much lower and the algorithm is powerful to adequacy evaluation of the transmission capacity in large scale networks. |
| |
| Keywords: | reliability planning network analysis |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文 |
