AN OPTIMAL ALGORITHM FOR FINDING A MAXIMUM INDEPENDENT SET OF A CIRCULAR-ARC GRAPH

被引：43
|
作者：
MASUDA, S [1 ]
NAKAJIMA, K [1 ]
机构：
[1] UNIV MARYLAND, SYST RES CTR, COLLEGE PK, MD 20742 USA
来源：
SIAM JOURNAL ON COMPUTING | 1988年 / 17卷 / 01期
关键词：
Computer Programming--Algorithms;
D O I：
10.1137/0217003
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the graph is given in the form of a family of n arcs, our algorithm requires only O(n&middotlog n) time and O(n) space. Furthermore, if the endpoints of the arcs are already sorted, it runs in O(n) time. This algorithm is time- and space-optimal to within a constant factor.
引用
收藏
页码：41 / 52
页数：12
相关论文
共 50 条
12345