文献类型：期刊文献

中文题名：计算网络两端可靠性的不交化改进算法

英文题名：AN IMPROVED DISJOINTING ALGORITHM FOR CALCULATING THE RELIABILITY OF S-T NETWORKS

作者：薛炜[1];帅典勋[1]

机构：[1]华东理工大学信息科学与工程学院,上海200237

年份：2006

卷号：23

期号：8

起止页码：19

中文期刊名：计算机应用与软件

外文期刊名：Computer Applications and Software

收录：CSTPCD;;北大核心:【北大核心2004】；CSCD:【CSCD_E2011_2012】；

基金：国家自然科学基金重点项目(60135010);国家"九七三"重点基础研究发展规划项目(G1999032707);国家自然科学基金项目(60073008)资助。

语种：中文

中文关键词：可靠性;最小路集;不交化算法

外文关键词：Reliability Minimal paths Disjointing algorithm

摘要：针对现实网络图的非封闭性特点,对可靠性不交化算法进行了改进,其主要思想就是根据网络图的最小路集把网络图分解成数个子图,求出这些子图的最小路集并对它们进行不交化运算求出所有子图的可靠性,进而求出整个网络图的可靠性。最后对改进前后的算法效率做了比较。
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.