EFFICIENT ALGORITHMS FOR THE DOMINATION PROBLEMS ON INTERVAL AND CIRCULAR ARC GRAPHS

被引：0
|
作者：
CHANG, MS
机构：
来源：
IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY | 1992年 / 12卷
关键词：
NONNUMERICAL ALGORITHMS AND PROBLEMS; GRAPH THEORY;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we shall present a new unified approach to solve the minimum-weight domination, independent, connected and total domination problems on interval graphs. Given the interval model with end points sorted, the algorithms take only O(n) or O(nloglogn) time and O(n) space. These algorithms are straightforward and simple but efficient. Then, we extend the results to solve the same four problems on circular-arc graphs in O(m+n) time and O(n) space.
引用
收藏
页码：402 / 408
页数：7
相关论文
共 50 条
  • [31] Interval Routing Schemes for Circular-Arc Graphs
    Gurski, Frank
    Poullie, Patrick Gwydion
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (01) : 39 - 60
  • [32] Efficient algorithms for the minimum connected domination on trapezoid graphs
    Lin, YL
    Hsu, FR
    Tsai, YT
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 126 - 136
  • [33] Efficient algorithms for Roman domination on some classes of graphs
    Liedloff, Mathieu
    Kloks, Ton
    Liu, Jiping
    Peng, Sheng-Lung
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (18) : 3400 - 3415
  • [34] Efficient algorithms for the minimum connected domination on trapezoid graphs
    Tsai, Yin-Te
    Lin, Yaw-Ling
    Hsu, F. R.
    INFORMATION SCIENCES, 2007, 177 (12) : 2405 - 2417
  • [35] Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
    Brandstaedt, Andreas
    Ficur, Pavel
    Leitert, Arne
    Milanic, Martin
    INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 256 - 262
  • [36] Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
    Marathe, MV
    Hunt, HB
    Ravi, SS
    DISCRETE APPLIED MATHEMATICS, 1996, 64 (02) : 135 - 149
  • [37] On interval and circular-arc covering problems
    Reuven Cohen
    Mira Gonen
    Annals of Operations Research, 2019, 275 : 281 - 295
  • [38] On interval and circular-arc covering problems
    Cohen, Reuven
    Gonen, Mira
    ANNALS OF OPERATIONS RESEARCH, 2019, 275 (02) : 281 - 295
  • [39] EFFICIENT TEST FOR CIRCULAR-ARC GRAPHS
    TUCKER, A
    SIAM JOURNAL ON COMPUTING, 1980, 9 (01) : 1 - 24
  • [40] Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs
    Chiarelli, Nina
    Hartinger, Tatiana Romina
    Alejandra Leoni, Valeria
    Lopez Pujato, Maria Ines
    Milanic, Martin
    COMBINATORIAL OPTIMIZATION, ISCO 2018, 2018, 10856 : 290 - 302
12345