| 网络系统最小割集的一种矩阵分解 |
| |
| 引用本文： | 余良德,孙新利,彭亚会.网络系统最小割集的一种矩阵分解[J].北京邮电大学学报,2007,29(2):123-126. |
| |
| 作者姓名： | 余良德 孙新利 彭亚会 |
| |
| 作者单位： | 第二炮兵工程学院,103教研室,西安,710025 |
| |
| 摘 要： | 为了寻求计算双终端网络系统最小割集更为简明的方法，扩展了网络联络矩阵的定义，形成了广义联络矩阵的概念，并基于此提出了一种矩阵分解算法，算法的基础是在一定运算规则下反复对广义联络矩阵进行分解。阐述了算法的理论原理及计算步骤，并给出了冗余节点、子图同构的判断方法和简化规则算例验证了本理论的正确性和适应性。
|
| 关 键 词： | 网络可靠度 最小割集 联络矩阵 |
| 文章编号： | 1007-5321（2007）02-0123-04 |
| 收稿时间： | 2006-04-20 |
| 修稿时间： | 2006年4月20日 |
A Matrix Decomposition Algorithm for Enumerating All Minimal Cut-set of a Network |
| |
| YU Liang-de,SUN Xin-li,PENG Ya-hui.A Matrix Decomposition Algorithm for Enumerating All Minimal Cut-set of a Network[J].Journal of Beijing University of Posts and Telecommunications,2007,29(2):123-126. |
| |
| Authors: | YU Liang-de SUN Xin-li PENG Ya-hui |
| |
| Affiliation: | (103 Department,The Second Artillery Engineering College, xi’an 710025, China) |
| |
| Abstract: | The definition of adjacent matrix was extended in order to effectively enumerate all minimal cut-set of a terminal network. And a matrix decomposition algorithm was then proposed. The algorithm is based on recursive matrix decomposition and reduction. The theoretical rationale and operational rules are given. The judgment principles and reduction rules about redundant nodes and isomorphic graphs are presented. The examples given show correctness and applicability of the algorithm, |
| |
| Keywords: | network reliability minimal cut-set adjacent matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
