Cutset Enumerating and Network Reliability Computing by a new Recursive Algorithm and Inclusion Exclusion Principle

Abstract

In this work we present a new and efficient recursive algorithm that enumerate all the s-t minimal cut sets (MCs) separating nodes s (source) and t (terminal) in a network system. The networks studied here are considered as the undirected graphs. Later enumerating all the MCs, the inclusion-exclusion principle is used to compute the network reliability based on the probabilities of the links.