Algorithms for generating maximum weight independent sets in circle graphs, circular-arc overlap graphs, and spider graphs

被引：0
|
作者：
Taki, M [1 ]
Hatakenaka, H
Kashiwabara, T
机构：
[1] Nara Natl Coll Technol, Dept Informat Engn, Yamatokohriyama 6391080, Japan
[2] Osaka Univ, Dept Informat & Comp Sci, Toyonaka, Osaka 5608531, Japan
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 1999年 / E82A卷 / 08期
关键词：
circle graph; independent set; generation algorithm; intersection graph; interval graph; overlap graph; spider graph; circular-arc overlap graph;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we propose an algorithm for generating maximum weight independent sets in a circle graph, that is, for putting out all maximum weight independent sets one by one without duplication. The time complexity is O(n(3) + beta), where n is the number of vertices, beta output size, i.e., the sum of the cardinalities of the output sets. It is shown that the same approach can be applied for spider graphs and for circuiar-arc overlap graphs.
引用
收藏
页码：1636 / 1640
页数：5
相关论文
共 50 条
  • [41] MATRIX CHARACTERIZATIONS OF CIRCULAR-ARC GRAPHS
    TUCKER, A
    PACIFIC JOURNAL OF MATHEMATICS, 1971, 39 (02) : 535 - &
  • [42] On the hyperbolicity constant of circular-arc graphs
    Reyes, Rosalio
    Rodriguez, Jose M.
    Sigarreta, Jose M.
    Villeta, Maria
    DISCRETE APPLIED MATHEMATICS, 2019, 263 : 244 - 256
  • [43] MINIMUM CUTS FOR CIRCULAR-ARC GRAPHS
    LEE, DT
    SARRAFZADEH, M
    WU, YF
    SIAM JOURNAL ON COMPUTING, 1990, 19 (06) : 1041 - 1050
  • [44] Power Domination in Circular-Arc Graphs
    Chung-Shou Liao
    D. T. Lee
    Algorithmica, 2013, 65 : 443 - 466
  • [45] Efficient algorithms for the domination problems on interval and circular-arc graphs
    Natl Chung Cheng Univ, Chiayi, Taiwan
    SIAM J Comput, 6 (1671-1694):
  • [46] On coherent configuration of circular-arc graphs
    Barandagh, Fatemeh Raei
    Barghi, Amir Rahnamai
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2025, 10 (01) : 1 - 19
  • [47] Some optimal parallel algorithms on interval and circular-arc graphs
    Hsu, FR
    Shan, MK
    Chao, HS
    Lee, RCT
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2005, 21 (03) : 627 - 642
  • [48] ON CHORDAL PROPER CIRCULAR-ARC GRAPHS
    BANGJENSEN, J
    HELL, P
    DISCRETE MATHEMATICS, 1994, 128 (1-3) : 395 - 398
  • [49] Efficient algorithms for the domination problems on interval and circular-arc graphs
    Chang, MS
    SIAM JOURNAL ON COMPUTING, 1998, 27 (06) : 1671 - 1694
  • [50] Balancedness of subclasses of circular-arc graphs
    Bonomo, Flavia
    Duran, Guillermo
    Safe, Martin D.
    Wagler, Annegret K.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (03): : 1 - 22
12345