imeration of Networks by Graph Search h Addition

This paper presents eflective algorithms for enumerating the minimal cutsets of networks. After a graph is modeled afer a network, jrst, by graph method the spanning tree of the graph and binary tree whose event is complement to it are evaluated. The sub-vertex set represented by the binary tree is referenced, and an algorithm which evaluates the minimal cutsets is proposed. This algorithm requires a space memorizing a topology of the graph, and has a time complexity which is proportional to a number of the edges of the graph and the binary tree. Second, by adding the branch, an algorithm enumerating the cutsets, which separates the sub-vertex set and a disjoint vertex set of the graph, is proposed. This algorithm doesn’t enumerate all the events which vertex and edge set can have, and executes computation to only the number of minimal cutsets. The space needed is proportional to the square of the number of the vertexes, and time complexity is in the order of the number of cutsets. The reliability is computed from the events of cutset.