Algorithms for the Determination of Cutsets in a Hypergraph

被引：0
|
作者：
姚荣 [1 ]
康泰 [1 ]
陈廷槐 [1 ]
机构：
[1] Chongqing University
来源：
Journal of Computer Science and Technology | 1990年 / 01期
关键词：
Algorithms for the Determination of Cutsets in a Hypergraph; link;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given a hypergraph, this paper provides three algorithms for finding all its minimal cutsets, minimal linkcutsets and the least cutsets. The result not only set up a new studying field on cutsets of hypergraph, butalso lay a foundation of analyzing the performance of multibus systems. The algorithm for determining all theleast cutsets in a hypergraph is polynomial complex and more efficient than that in [2].
引用
收藏
页码：41 / 46
页数：6
相关论文
共 50 条
  • [21] Resolution based algorithms for the transversal hypergraph generation problem
    Cosmadakis, Stavros
    Kavvadias, Dimitris
    Panagopoulou, Lina
    THEORETICAL COMPUTER SCIENCE, 2020, 815 : 1 - 10
  • [22] Hypergraph traversal revisited: Cost measures and dynamic algorithms
    Ausiello, G
    Italiano, GF
    Nanni, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 1 - 16
  • [23] Lower bounds for three algorithms for the transversal hypergraph generation
    Hagen, Matthias
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 316 - 327
  • [24] RANDOM HYPERGRAPH COLORING ALGORITHMS AND THE WEAK CHROMATIC NUMBER
    SCHMIDTPRUZAN, J
    SHAMIR, E
    UPFAL, E
    JOURNAL OF GRAPH THEORY, 1985, 9 (03) : 347 - 362
  • [25] More efficient algorithms for searching for several edges in a hypergraph
    Chen, Ting
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024,
  • [26] Improved bounds and algorithms for hypergraph two-coloring
    Radhakrishnan, J
    Srinivasan, A
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 684 - 693
  • [27] Novel Algorithms for Quadratic Programming by Using Hypergraph Representations
    Dávid Tisza
    András Oláh
    János Levendovszky
    Wireless Personal Communications, 2014, 77 : 2305 - 2339
  • [28] Improved bounds and algorithms for hypergraph 2-coloring
    Radhakrishnan, J
    Srinivasan, A
    RANDOM STRUCTURES & ALGORITHMS, 2000, 16 (01) : 4 - 32
  • [29] Novel Algorithms for Quadratic Programming by Using Hypergraph Representations
    Tisza, David
    Olah, Andras
    Levendovszky, Janos
    WIRELESS PERSONAL COMMUNICATIONS, 2014, 77 (03) : 2305 - 2339
  • [30] Lower bounds for three algorithms for transversal hypergraph generation
    Hagen, Matthias
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1460 - 1469
12345