In this paper we propose an algorithm for obtaining all minimal cut sets for a given two-terminal network. The algorithm works on undirected networks without matter whether they are coherent or not. The difference between this algorithm and the other proposed algorithms is in the fact that there are not received candidates for minimal cut set that are not minimal cut sets. A large part of the paper proves the correctness of the algorithm and analyzes its complexity.
Network, minimal cut set, cut set, undirected network, connected network, graph.
© Association for Information and Communication Technologies www.ict-act.org Developed by tdelev