ENUMERATION OF ALL CUTSETS OF A GRAPH

被引：0

|

作者：

RAO, VVB

SANKARAN, P

RAO, KS

MURTI, VGK

机构：

来源：

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS | 1968年 / 56卷 / 07期

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

引用

收藏

页码：1247 / &

相关论文

共 50 条

[1] ENUMERATION OF ALL CUTSETS OF A GRAPH
RAO, KS
RAO, VVB
SANKARAN, P
MURTI, VGK
ELECTRONICS LETTERS, 1969, 5 (10) : 208 - &
[2] ENUMERATION OF ALL CIRCUITS OR CUTSETS OF A GRAPH
RAO, VVB
MURTI, VGK
ELECTRONICS LETTERS, 1970, 6 (04) : 104 - &
[3] An Simple Enumeration of All Minimal Cutsets of an All-Terminal Graph
Zhang Hongfen(Shijiazhuang Postal College
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
IEEE TRANSACTIONS ON RELIABILITY, 1993, 42 (01) : 44 - 45
[5] ENUMERATION OF MINIMAL CUTSETS OF AN UNDIRECTED GRAPH
AHMAD, SH
MICROELECTRONICS AND RELIABILITY, 1990, 30 (01): : 23 - 26
[6] SIMPLE ENUMERATION OF MINIMAL CUTSETS OF ACYCLIC DIRECTED GRAPH
AHMAD, SH
IEEE TRANSACTIONS ON RELIABILITY, 1988, 37 (05) : 484 - 487
[7] ON AN ALGORITHM TO ENUMERATE ALL THE CUTSETS IN A GRAPH
TSUKIYAMA, S
SHIRAKAWA, I
OZAKI, H
ELECTRONICS & COMMUNICATIONS IN JAPAN, 1978, 61 (07): : 9 - 15
[8] ALGEBRAIC DETERMINATION OF ALL VERTEX CUTSETS IN A GRAPH
MYERS, BR
PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1969, 116 (04): : 510 - &
[9] Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition
Suh, H
Chang, CK
25TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS - PROCEEDINGS, 2000, : 100 - 107
[10] 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

← 1 2 3 4 5 →