An algorithm for generating minimal cutsets of undirected graphs

被引：1
|
作者：
Yong Yeon Shin [1 ]
Jai Sang Koh [1 ]
机构：
[1] Electronics and Telecommunications Research Institute,Reliability Engineering Section
来源：
Korean Journal of Computational & Applied Mathematics | 1998年 / 5卷 / 3期
关键词：
90B25; 94C15; minimal cutset; undirected graph; algorithm;
D O I：
10.1007/BF03008891
中图分类号：
学科分类号：
摘要：
In this paper, we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutset exactly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets atO(e · n) {wheree,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.
引用
收藏
页码：681 / 693
页数：12
相关论文
共 50 条
  • [41] On stable cutsets in line graphs
    Le, VB
    Randerath, B
    THEORETICAL COMPUTER SCIENCE, 2003, 301 (1-3) : 463 - 475
  • [42] Matrices, shortest paths, minimal cuts and Euclidian metric for undirected graphs
    Rusakov, Victor A.
    POSTPROCEEDINGS OF THE 9TH ANNUAL INTERNATIONAL CONFERENCE ON BIOLOGICALLY INSPIRED COGNITIVE ARCHITECTURES (BICA 2018), 2018, 145 : 444 - 447
  • [43] Mathematical foundations of minimal cutsets
    Rauzy, A
    IEEE TRANSACTIONS ON RELIABILITY, 2001, 50 (04) : 389 - 396
  • [44] Skewness of Graphs with Small Cutsets
    Graham Farr
    Peter Eades
    Graphs and Combinatorics, 2003, 19 : 177 - 194
  • [45] ALGORITHMS FOR GENERATING ALL SPANNING-TREES OF UNDIRECTED, DIRECTED AND WEIGHTED GRAPHS
    KAPOOR, S
    RAMESH, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 461 - 472
  • [46] A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs
    Chakrabarty, Deeparnab
    Liao, Hang
    INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 201, 2023, 201 : 259 - 274
  • [47] A shortest path algorithm for real-weighted undirected graphs
    Pettie, S
    Ramachandran, V
    SIAM JOURNAL ON COMPUTING, 2005, 34 (06) : 1398 - 1431
  • [48] AN INFERENCE ALGORITHM FOR MONOTONE BOOLEAN FUNCTIONS ASSOCIATED WITH UNDIRECTED GRAPHS
    Gainanov, D. N.
    Rasskazova, V. A.
    BULLETIN OF THE SOUTH URAL STATE UNIVERSITY SERIES-MATHEMATICAL MODELLING PROGRAMMING & COMPUTER SOFTWARE, 2016, 9 (03): : 17 - 30
  • [49] Matching cutsets in graphs of diameter 2
    Borowiecki, Mieuyslaw
    Jesse-Jozefczyk, Katarzyna
    THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) : 574 - 582
  • [50] An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs
    Pugliese, Luigi Di Puglia
    Gaudioso, Manlio
    Guerriero, Francesca
    Miglionico, Giovanna
    MATHEMATICAL SOFTWARE, ICMS 2016, 2016, 9725 : 492 - 497
12345