ON AN ALGORITHM TO ENUMERATE ALL THE CUTSETS IN A GRAPH

被引：0

|

作者：

TSUKIYAMA, S

SHIRAKAWA, I

OZAKI, H

机构：

来源：

ELECTRONICS & COMMUNICATIONS IN JAPAN | 1978年 / 61卷 / 07期

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

收藏

页码：9 / 15

页数：7

相关论文

共 50 条

[1] 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
[2] A new algorithm for generating all minimal cutsets in a graph
Sun, Y.
Zhang, X.
Xu, M.
[J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2001, 22 (05): : 576 - 579
[3] 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 - &
[4] ENUMERATION OF ALL CUTSETS OF A GRAPH
RAO, KS
RAO, VVB
SANKARAN, P
MURTI, VGK
[J]. ELECTRONICS LETTERS, 1969, 5 (10) : 208 - &
[5] ENUMERATION OF ALL CIRCUITS OR CUTSETS OF A GRAPH
RAO, VVB
MURTI, VGK
[J]. ELECTRONICS LETTERS, 1970, 6 (04) : 104 - &
[6] ALGEBRAIC DETERMINATION OF ALL VERTEX CUTSETS IN A GRAPH
MYERS, BR
[J]. PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1969, 116 (04): : 510 - &
[7] 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
[8] 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
[9] 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
[10] PETRI NET APPROACH TO ENUMERATE ALL SIMPLE PATHS IN A GRAPH
KHAN, AA
SINGH, H
[J]. ELECTRONICS LETTERS, 1980, 16 (08) : 291 - 292

← 1 2 3 4 5 →