Analysis of an Algorithm for finding Minimal Cut Set for Undirected Network
Journal
ICT Innovations 2010, Web proceedings
Date Issued
2010
Author(s)
Stojkovich, Natasha
Abstract
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.
