一种计算复杂网络可靠度的新算法

A New Algorithm for Calculating Overall Reliability of Complex Network

利用基于基本互补划分（ＥＣＰ）求复杂网络的树的原理，发展了一种新的求不交化树的方法。

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.