COMPUTING ROOTED COMMUNICATION RELIABILITY OF NETWORKS USING FACTORING METHOD
利用因子分解方法计算网络的根通信可靠性

This paper uses factoring method for computing rooted communication reliability of networks, i.e., the proability that there are operating paths from the root vertex to all other vertices. Two new reliability-preserving reductions and an edge-selection strategy are presented by using the topological structure of acyclic directed networks. Based on that, a factoring algorithm is developed. It is very efficient for networks which are not very dense.