graph theorybottleneckgraph theoryoptimal construction costThis research proposes a method based on the graph theory for transmission network expansion planning. The proposed method suggests an optimal investment cost for transmission network expansion planning by using the minimal cut sets based on the ...
Application of graph theory to reliability analysis was first made in 1970 [1]. Over the years, a large number of computer programmes have been developed to determine the spanning trees, the minimal paths and cutsets, which are essential for determining the reliability of the network. In recent...
Complete multi-partite cutsets in minimal imperfect graphs. We show that a minimal imperfect graph G cannot contain a cutset C which induces a complete multi-partite graph unless C is a stable set and G is an od... G Cornuéjols,B Reed - 《Journal of Combinatorial Theory》 被引量: 31...
1.On finding the versatile solution of theleast cut setand least path set in Fault Tree Analysis by computer;事故树分析中最小割集、最小径集的计算机求解 2.In the first layer calculation, the reliability is redistributed among theleast cut sets, and then the reliability is equivalently distribute...
This paper deals with the enumeration of all minimal s-t vertex cutsets separating two vertices (source and terminal) in an undirected graph. The problem... C Patvardhan,Prasad, V.C.,Pyara, V.P. - 《IEEE Transactions on Reliability》 被引量: 34发表: 1995年 Algorithmic graph theory This...
Graph Theory P.S.R. Murty, in Power Systems Analysis (Second Edition), 2017 2.5 Cut-Set A cut set is a minimal set of branches K of a connected graph G, such that the removal of all K branches divides the graph into two parts. It is also true that the removal of K branches redu...
Cut-Set Graph and Systematic Generation of Separating Sets In this paper an efficient method of generating separating sets of a given graph with the use of a newly defined concept-a cutset graph-is discussed. The c... H Ariyoshi - 《IEEE Transactions on Circuit Theory》 被引量: 17发表: ...
Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph This paper presents an efficient implicit enumeration algorithm for generating all minimal cut-sets separating a specified node pair in a connected graph. ... S Arunkumar,SH Lee - 《IEEE Transactions on Reliability》 被引量: 31...
In the context of reducible surgery, one of the two planar graphs will necessarily contain a Scharlemann cycle. So, we define a strict x-cycle to be... JA Hoffman - 《Journal of Knot Theory & Its Ramifications》 被引量: 48发表: 1998年 Simple enumeration of minimal cutsets separating 2...
The fundamental concepts and definitions, such as saturated flow, blocking flow, blocking cutset and minimal flow are introduced, the theorems concerned are proved, and the branch-and-bound method for determining the minimal flow of a network is presented in the paper. This method is a ...