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 条
12345