• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.595-603
• /
• 1992

It has been establisued that the reliability of communication networks is NP hard problem owing to computationally and complexity as the number of componeuts is Increased in large networks. This paper proposed an algorithm for determining upper and lower bounds In the reliability of source-to-terminal in communication networks to solve this problem. The evaluation method follows the next procedures. First, minimal pathset and minimal cut set are serched. Second, it is sorted that the number of components is the same events and the reliability bounds Is evaluated by the section function to extract common variable. The performance of proposed algorithm is also estimate(1 as compared to the reliability of Esary-Proschan, Shogan and Copal.