Exact enumeration of minimal paths of partitioned networks
Abstract The accuracy of the available approximate approaches for the enumeration of minimal paths of networks decomposed into two sub networks through a cut is discussed and two theorems on the sufficient conditions for a sound application of these approaches are formulated. A method is suggested which extends the applicability of the partition approach for an exact reliability analysis of composite networks with an arbitrary number of sub networks common nodes. Two illustrative examples are also included.