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 条
  • [31] Improved approximation algorithms for weighted hypergraph embedding in a cycle
    Ho, Hann-Jang
    Lee, Singling
    SIAM JOURNAL ON OPTIMIZATION, 2007, 18 (04) : 1490 - 1500
  • [32] ANTICHAIN CUTSETS
    RIVAL, I
    ZAGUIA, N
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1985, 1 (03): : 235 - 247
  • [33] Galaxy cutsets in graphs
    Sonnerat, Nicolas
    Vetta, Adrian
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 19 (03) : 415 - 427
  • [34] Hypergraph models and algorithms for data-pattern-based clustering
    Ozdal, MM
    Aykanat, C
    DATA MINING AND KNOWLEDGE DISCOVERY, 2004, 9 (01) : 29 - 57
  • [35] Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability
    Gaur, DR
    Krishnamurti, R
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001, 5 (02) : 167 - 173
  • [36] Approximation Algorithms for Embedding a Weighted Directed Hypergraph on a Mixed Cycle
    Li, Jianping
    Li, Weidong
    Li, Jianbo
    Zhu, Juanping
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 67 - +
  • [37] Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability
    Daya Ram Gaur
    Ramesh Krishnamurti
    Journal of Combinatorial Optimization, 2001, 5 : 167 - 173
  • [38] Hypergraph Models and Algorithms for Data-Pattern-Based Clustering
    Muhammet Mustafa Ozdal
    Cevdet Aykanat
    Data Mining and Knowledge Discovery, 2004, 9 : 29 - 57
  • [39] Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms
    Yamaguchi, Yutaro
    Ogawa, Anna
    Takeda, Akiko
    Iwata, Satoru
    2014 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM), 2014, : 824 - 829
  • [40] Hypergraph recovery algorithms from a given vector of vertex degrees
    D. S. Kostyanoi
    A. V. Mokryakov
    V. I. Tsurkov
    Journal of Computer and Systems Sciences International, 2014, 53 : 511 - 516
12345