An algorithm for generating minimal cutsets of undirected graphs

被引：1
|
作者：
Yong Yeon Shin [1 ]
Jai Sang Koh [1 ]
机构：
[1] Electronics and Telecommunications Research Institute,Reliability Engineering Section
来源：
Korean Journal of Computational & Applied Mathematics | 1998年 / 5卷 / 3期
关键词：
90B25; 94C15; minimal cutset; undirected graph; algorithm;
D O I：
10.1007/BF03008891
中图分类号：
学科分类号：
摘要：
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 cutset exactly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets atO(e · n) {wheree,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.
引用
收藏
页码：681 / 693
页数：12
相关论文
共 50 条
12345