计算网络K-终端可靠性的一种K-树拆法

A K-Tree Algorithm for Computing K- Terminal Reliability in Networks

给出了计算网络K-终端可靠性的一种K-树拆法,用这种方法,计算复杂网络K-终端可靠性时,不用求出全部K-树,从而有效地提高了计算速度。此方法也适用于有向网络。

This paper gives an K-tree algorithm for computing K-terminal reliability in complex networks. When the algorithm is in application to the computation of K-terminal reliability,it is unnecessary to find all K-tree in a network. It can also be applied to oriented networks. The method is therefore available to accelerate the computation.