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 条

[1] VERTEX CUTSETS OF UNDIRECTED GRAPHS
PATVARDHAN, C
PRASAD, VC
PYARA, VP
IEEE TRANSACTIONS ON RELIABILITY, 1995, 44 (02) : 347 - 353
[2] Vertex cutsets of undirected graphs
Patvardhan, C., 1600, IEEE, Piscataway, NJ, United States (44):
[3] ENUMERATION OF MINIMAL CUTSETS OF AN UNDIRECTED GRAPH
AHMAD, SH
MICROELECTRONICS AND RELIABILITY, 1990, 30 (01): : 23 - 26
[4] ITERATIVE ALGORITHMS FOR GENERATING MINIMAL CUTSETS IN DIRECTED-GRAPHS
SHIER, DR
WHITED, DE
NETWORKS, 1986, 16 (02) : 133 - 147
[5] A new algorithm for generating all minimal cutsets in a graph
Sun, Y.
Zhang, X.
Xu, M.
Dongbei Daxue Xuebao/Journal of Northeastern University, 2001, 22 (05): : 576 - 579
[6] SIMPLE ENUMERATION OF MINIMAL CUTSETS SEPARATING 2 VERTICES IN A CLASS OF UNDIRECTED PLANAR GRAPHS
SUNG, CS
YOO, BK
IEEE TRANSACTIONS ON RELIABILITY, 1992, 41 (01) : 63 - 71
[7] ALGORITHMS FOR GENERATING MINIMAL CUTSETS BY INVERSION
SHIER, DR
WHITED, DE
IEEE TRANSACTIONS ON RELIABILITY, 1985, 34 (04) : 314 - 319
[8] A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs
T. Matsui
Algorithmica, 1997, 18 : 530 - 543
[9] A flexible algorithm for generating all the spanning trees in undirected graphs
Matsui, T
ALGORITHMICA, 1997, 18 (04) : 530 - 543
[10] ENUMERATION OF MINIMAL CUTSETS FROM MATRIX REPRESENTATION OF DIRECTED UNDIRECTED NETWORKS
GHOSH, SK
SINGH, B
MICROELECTRONICS RELIABILITY, 1993, 33 (07) : 947 - 949

← 1 2 3 4 5 →