A NEW ALGORITHM TO COMPUTE VERTEX CUTSETS IN A GRAPH

被引：1
|
作者：
SRIMANI, PK
DE, D
SINHA, BP
机构：
[1] JADAVPUR UNIV, REG COMP CTR, CALCUTTA 700032, INDIA
[2] INDIAN STAT INST, ELECTR UNIT, CALCUTTA 700035, W BENGAL, INDIA
来源：
COMPUTERS & ELECTRICAL ENGINEERING | 1981年 / 8卷 / 04期
关键词：
D O I：
10.1016/0045-7906(81)90009-4
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：293 / 299
页数：7
相关论文
共 50 条
  • [1] GENERATION OF VERTEX AND MIXED CUTSETS IN A GRAPH
    NIEMINEN, J
    PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1972, 119 (08): : 1110 - &
  • [2] ALGEBRAIC DETERMINATION OF ALL VERTEX CUTSETS IN A GRAPH
    MYERS, BR
    PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1969, 116 (04): : 510 - &
  • [3] 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
  • [4] 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
  • [5] VERTEX CUTSETS OF UNDIRECTED GRAPHS
    PATVARDHAN, C
    PRASAD, VC
    PYARA, VP
    IEEE TRANSACTIONS ON RELIABILITY, 1995, 44 (02) : 347 - 353
  • [6] GENERATION OF VERTEX AND EDGE CUTSETS
    PRASAD, VC
    SANKAR, V
    RAO, KSP
    MICROELECTRONICS AND RELIABILITY, 1992, 32 (09): : 1291 - 1310
  • [7] Vertex cutsets of undirected graphs
    Patvardhan, C., 1600, IEEE, Piscataway, NJ, United States (44):
  • [8] VERTEX CUTSETS AND CIRCUIT LAYOUT
    NIEMINEN, J
    PROCEEDINGS OF THE IEEE, 1976, 64 (08) : 1245 - 1246
  • [9] ENUMERATION OF ALL CUTSETS OF A GRAPH
    RAO, VVB
    SANKARAN, P
    RAO, KS
    MURTI, VGK
    PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1968, 56 (07): : 1247 - &
  • [10] ENUMERATION OF ALL CUTSETS OF A GRAPH
    RAO, KS
    RAO, VVB
    SANKARAN, P
    MURTI, VGK
    ELECTRONICS LETTERS, 1969, 5 (10) : 208 - &
12345