Estimation of Minimal Path Vectors of Multi State Two Terminal Networks with Cycles Control

摘要

One of the hardest problems in two terminal networks reliability theory is to obtain minimal path or cut vectors of such a network. Moreover, the bigger problem is appeared when we have a network with cycles. Here we give one algorithm solution for such a problem.