Efficient algorithms for the domination problems on interval and circular-arc graphs

被引：0

|

作者：

Natl Chung Cheng Univ, Chiayi, Taiwan ^{[1
]}

机构：

来源：

SIAM J Comput | / 6卷 / 1671-1694期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] Efficient algorithms for the domination problems on interval and circular-arc graphs
Chang, MS
SIAM JOURNAL ON COMPUTING, 1998, 27 (06) : 1671 - 1694
[2] EFFICIENT ALGORITHMS FOR THE DOMINATION PROBLEMS ON INTERVAL AND CIRCULAR ARC GRAPHS
CHANG, MS
IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 402 - 408
[3] Polynomial algorithms for weighted perfect domination problems on interval and circular-arc graphs
Chang, M.S.
Liu, Y.C.
Journal of Information Science and Engineering, 1994, 10 (04)
[4] EFFICIENT ALGORITHMS FOR INTERVAL-GRAPHS AND CIRCULAR-ARC GRAPHS
GUPTA, UI
LEE, DT
LEUNG, JYT
NETWORKS, 1982, 12 (04) : 459 - 467
[5] Paired domination on interval and circular-arc graphs
Cheng, T. C. E.
Kang, L. Y.
Ng, C. T.
DISCRETE APPLIED MATHEMATICS, 2007, 155 (16) : 2077 - 2086
[6] Efficient algorithms for centers and medians in interval and circular-arc graphs
Bespamyatnikh, S
Bhattacharya, B
Keil, M
Kirkpatrick, D
Segal, M
NETWORKS, 2002, 39 (03) : 144 - 152
[7] Power Domination in Circular-Arc Graphs
Liao, Chung-Shou
Lee, D. T.
ALGORITHMICA, 2013, 65 (02) : 443 - 466
[8] Power Domination in Circular-Arc Graphs
Chung-Shou Liao
D. T. Lee
Algorithmica, 2013, 65 : 443 - 466
[9] Parallel algorithms for finding the center of interval and circular-arc graphs
Hsu, FR
Shan, MK
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (10) : 2704 - 2709
[10] 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

← 1 2 3 4 5 →