| 计算网络两端可靠性的不交化改进算法 |
| |
| 引用本文： | 薛炜,帅典勋. 计算网络两端可靠性的不交化改进算法[J]. 计算机应用与软件, 2006, 23(8): 19-21 |
| |
| 作者姓名： | 薛炜 帅典勋 |
| |
| 作者单位： | 华东理工大学信息科学与工程学院,上海,200237;华东理工大学信息科学与工程学院,上海,200237;清华大学智能技术与系统国家重点实验室,北京,100084 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划);国家研究发展基金;国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 针对现实网络图的非封闭性特点，对可靠性不交化算法进行了改进，其主要思想就是根据网络图的最小路集把网络图分解成数个子图．求出这些子图的最小路集并对它们进行不交化运算求出所有子图的可靠性，进而求出整个网络图的可靠性。最后对改进前后的算法效率做了比较。
|
| 关 键 词： | 可靠性 最小路集 不交化算法 |
| 收稿时间： | 2004-09-15 |
| 修稿时间： | 2004-09-15 |
AN IMPROVED DISJOINTING ALGORITHM FOR CALCULATING THE RELIABILITY OF S-T NETWORKS |
| |
| Xue Wei,Shuai Dianxun. AN IMPROVED DISJOINTING ALGORITHM FOR CALCULATING THE RELIABILITY OF S-T NETWORKS[J]. Computer Applications and Software, 2006, 23(8): 19-21 |
| |
| Authors: | Xue Wei Shuai Dianxun |
| |
| Affiliation: | 1. School of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China ; 2 . State Key Laboratory of Intelligence Technology and System, Tsinghua University, Beijing 100084, China |
| |
| Abstract: | According to the topology of real networks not always being close in,an improved disjointing algorithm for calculating the reliability of networks is put forward. Its basic idea is that judging by the minimal paths the networks graphic is divided into sub-graphics ,after sub-graphics is disjointed by each minimal paths,we can get each sub-graphics reliability ,and the reliability of the networks graphics can be calculated by these sub-graphics reliabilities. The efficiencies of the two different algorithms are compared in the end of the article. |
| |
| Keywords: | Reliability Minimal paths Disjointing algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
