A new algorithm for generating all minimal cutsets in a graph

被引：0

作者：

Sun, Y. ^{[1
]}

Zhang, X. ^{[1
]}

Xu, M. ^{[1
]}

机构：

[1] School of Science, Northeastern University, Shenyang 110004, China

来源：

Dongbei Daxue Xuebao/Journal of Northeastern University | 2001年 / 22卷 / 05期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：576 / 579

共 50 条

[1] ON AN ALGORITHM TO ENUMERATE ALL THE CUTSETS IN A GRAPH
TSUKIYAMA, S
SHIRAKAWA, I
OZAKI, H
[J]. ELECTRONICS & COMMUNICATIONS IN JAPAN, 1978, 61 (07): : 9 - 15
[2] An algorithm for generating minimal cutsets of undirected graphs
Yong Yeon Shin
Jai Sang Koh
[J]. Korean Journal of Computational & Applied Mathematics, 1998, 5 (3) : 681 - 693
[3] An Simple Enumeration of All Minimal Cutsets of an All-Terminal Graph
Zhang Hongfen(Shijiazhuang Postal College
[J]. The Journal of China Universities of Posts and Telecommunications, 1995, (02) : 78 - 80
[4] COMMENT ON - ENUMERATION OF ALL MINIMAL CUTSETS FOR A NODE PAIR IN A GRAPH
SANKAR, V
PRASAD, VC
RAO, KSP
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1993, 42 (01) : 44 - 45
[5] A NEW ALGORITHM TO COMPUTE VERTEX CUTSETS IN A GRAPH
SRIMANI, PK
DE, D
SINHA, BP
[J]. COMPUTERS & ELECTRICAL ENGINEERING, 1981, 8 (04) : 293 - 299
[6] ENUMERATION OF ALL CUTSETS OF A GRAPH
RAO, VVB
SANKARAN, P
RAO, KS
MURTI, VGK
[J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1968, 56 (07): : 1247 - &
[7] ENUMERATION OF ALL CUTSETS OF A GRAPH
RAO, KS
RAO, VVB
SANKARAN, P
MURTI, VGK
[J]. ELECTRONICS LETTERS, 1969, 5 (10) : 208 - &
[8] ALGORITHMS FOR GENERATING MINIMAL CUTSETS BY INVERSION
SHIER, DR
WHITED, DE
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1985, 34 (04) : 314 - 319
[9] ENUMERATION OF MINIMAL CUTSETS OF AN UNDIRECTED GRAPH
AHMAD, SH
[J]. MICROELECTRONICS AND RELIABILITY, 1990, 30 (01): : 23 - 26
[10] AN ALGORITHM TO ENUMERATE ALL CUTSETS OF A GRAPH IN LINEAR TIME PER CUTSET
TSUKIYAMA, S
SHIRAKAWA, I
OZAKI, H
ARIYOSHI, H
[J]. JOURNAL OF THE ACM, 1980, 27 (04) : 619 - 632

← 1 2 3 4 5 →