关键词: 网络可靠度, 极小路, 极小割, 状态向量, 分解技术

Abstract: Network reliability is a core index of network performance evaluation.With the extensive application of network models in realistic life，people take more attentions on the research of network reliability.Considering the shortcomings of sum-of-disjoint products algorithm and factoring decomposition algorithm，a new decomposition algorithm for computing two-terminal network reliability is proposed.The proposed algorithm has the following advantages：It doesn’t require all MPs and all MCs to be enumerated in advance;By introducing the network simplification operations and a novel decomposition technique，the proposed algorithm can decompose the state of more edges each time，so it can decompose the state vectors set of the network more quickly and more effectively.Therefore，computing reliability becomes simpler，and more efficient.Finally，the correctness and efficiency of the proposed algorithm are illustrated by an example and comparisons with other algorithms.

Key words: network reliability, minimal path, minimal cut, state vector, decomposition technique