| 一种计算复杂网络可靠度的新算法 |
| |
| 引用本文： | 曹均华,王旭东,吴新余. 一种计算复杂网络可靠度的新算法[J]. 南京邮电大学学报(自然科学版), 1996, 0(4) |
| |
| 作者姓名： | 曹均华 王旭东 吴新余 |
| |
| 作者单位： | 南京邮电学院基础课部 |
| |
| 摘 要： | 利用基于基本互补划分（ＥＣＰ）求复杂网络的树的原理，发展了一种新的求不交化树的方法，从而能有效地计算一个复杂网络的全可靠度
|
| 关 键 词： | 可靠性理论，网络可靠性，不交化树 |
A New Algorithm for Calculating Overall Reliability of Complex Network |
| |
| Cao Junhua Wang Xudong Wu Xinyu. A New Algorithm for Calculating Overall Reliability of Complex Network[J]. JJournal of Nanjing University of Posts and Telecommunications, 1996, 0(4) |
| |
| Authors: | Cao Junhua Wang Xudong Wu Xinyu |
| |
| Affiliation: | Cao Junhua Wang Xudong Wu Xinyu Department of basic courses,Nanjing Institute of Posts and Telecommunications,210003,Nanjing,PRC |
| |
| Abstract: | The new algorithm finding the disjoint trees based on the ECP(Essential Complementary Partition) is presented.For a complicated graph,we can produce all of trees by using ECP,then adopting the new method to obtain the disjoint trees,so that the reliability of complicated network is effictively solved. |
| |
| Keywords: | Reliability Network reliability Disjoint trees |
| 本文献已被 CNKI 等数据库收录！ |
