New Algorithm to Evaluate the Unreliability of Flow Networks Based on Minimal Cutsets

摘要

Several conclusions on minimal cutset are proposed, from which a new algorithm is deduced to evaluate the unreliability of flow networks. Beginning with one unreliability product of the network, disjointed unreliability products are branched Out one by one, every of which is selected from the network minimal cutsets. Finally the unreliability of the network is obtained by adding all these unreliability products up.