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 条
  • [21] Minimum Fill-in on Circle and Circular-Arc Graphs
    Faculty of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, Netherlands
    不详
    不详
    不详
    J Algorithms, 2 (272-289):
  • [22] Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
    Duran, Guillermo
    Grippo, Luciano N.
    Safe, Martin D.
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 427 - 443
  • [23] On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
    Chandran, L. Sunil
    Francis, Mathew C.
    Sivadasan, Naveen
    GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT: ESSAYS DEDICATED TO MARTIN CHARLES GOLUMBIC ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5420 : 148 - +
  • [24] Pathwidth of circular-arc graphs
    Suchan, Karol
    Todinca, Ioan
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 258 - +
  • [25] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (04) : 647 - 655
  • [26] TREEWIDTH OF CIRCULAR-ARC GRAPHS
    SUNDARAM, R
    SINGH, KS
    RANGAN, CP
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 41 - 41
  • [27] IRREDUNDANCY IN CIRCULAR-ARC GRAPHS
    GOLUMBIC, MC
    LASKAR, RC
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 79 - 89
  • [28] CHARACTERIZING CIRCULAR-ARC GRAPHS
    TUCKER, A
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 76 (06) : 1257 - &
  • [29] Canonical Representations for Circular-Arc Graphs Using Flip Sets
    Chandoo, Maurice
    ALGORITHMICA, 2018, 80 (12) : 3646 - 3672
  • [30] Canonical Representations for Circular-Arc Graphs Using Flip Sets
    Maurice Chandoo
    Algorithmica, 2018, 80 : 3646 - 3672
12345