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 条
  • [21] On minimum cutsets in independent domination vertex-critical graphs
    Ananchuen, Nawarat
    Ruangthampisan, Sriphan
    Ananchuen, Watcharaphong
    Caccetta, Louis
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 71 : 369 - 380
  • [22] An algorithm for calculating the independence and vertex-cover polynomials of a graph
    Cash, Gordon G.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 190 (02) : 1487 - 1491
  • [23] A linear-time algorithm to compute a MAD tree of an interval graph
    Dahlhaus, E
    Dankelmann, P
    Ravi, R
    INFORMATION PROCESSING LETTERS, 2004, 89 (05) : 255 - 259
  • [24] A Graph Clustering Algorithm Based on the Intra Vertex Adjacent Ratio
    Guo, Haili
    Wang, Deqiang
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, SIMULATION AND MODELLING, 2016, 41 : 129 - 132
  • [25] Algorithm to Construct Graph with Total Vertex Irregularity Strength Two
    Silaban, Denny Riama
    Kekaleniate, Hikmatiarahmah
    Lutpiah, Siti
    Sugeng, Kiki Ariyanti
    Baskoro, Edy Tri
    2ND INTERNATIONAL CONFERENCE OF GRAPH THEORY AND INFORMATION SECURITY, 2015, 74 : 132 - 137
  • [26] Algorithm for the Vertex-Distinguishing Total Coloring of Complete Graph
    Li Jingwen
    Xu Xiaoqing
    Yan Guanghui
    PROCEEDINGS OF THE 2011 2ND INTERNATIONAL CONGRESS ON COMPUTER APPLICATIONS AND COMPUTATIONAL SCIENCE, VOL 2, 2012, 145 : 273 - 278
  • [27] An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph
    Honma, Hirotoshi
    Kitamura, Yutaro
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (06) : 1381 - 1385
  • [28] Analysis of greedy algorithm for vertex covering of random graph by cubes
    Toman, Eduard
    Stanek, Martin
    COMPUTING AND INFORMATICS, 2006, 25 (05) : 393 - 404
  • [29] CONNECTED CUTSETS OF A GRAPH AND TRIANGLE BASES OF THE CYCLE SPACE
    DUCHET, P
    VERGNAS, ML
    MEYNIEL, H
    DISCRETE MATHEMATICS, 1986, 62 (02) : 145 - 154
  • [30] SIMPLE ENUMERATION OF MINIMAL CUTSETS OF ACYCLIC DIRECTED GRAPH
    AHMAD, SH
    IEEE TRANSACTIONS ON RELIABILITY, 1988, 37 (05) : 484 - 487
12345