A new algorithm for computing the overall network reliability

被引：0
|
作者：
Liu, C [1 ]
Dai, MD [1 ]
Wu, XY [1 ]
Chen, WK [1 ]
机构：
[1] Nanjing Univ Posts & Telecommun, Inst Neural Networks & Syst Optimizat, Nanjing 21003, Jiangsu, Peoples R China
来源：
ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS | 1999年
关键词：
reliability; graph theory; elementary tree transformation;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The paper proposes an algorithm for computing the overall network reliability based on elementary tree transformations. It can directly find out the set of disjoint trees in a network graph without additional tree-disjointing operations. Such a derived set of disjoint trees contains the same number of trees as does the network graph and therefore is of the simplest and in optimal form. This algorithm is effective in computer implementation.
引用
收藏
页码：149 / 152
页数：4
相关论文
共 50 条
12345