DOMINATION ON COCOMPARABILITY GRAPHS

被引：86
|
作者：
KRATSCH, D
STEWART, L
机构：
[1] UNIV ALBERTA,DEPT COMP SCI,EDMONTON T6G 2H1,AB,CANADA
[2] UNIV TORONTO,TORONTO M5S 1A1,ONTARIO,CANADA
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1993年 / 6卷 / 03期
关键词：
DOMINATION; COCOMPARABILITY GRAPHS; GRAPH ALGORITHMS;
D O I：
10.1137/0406032
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The authors determine the algorithmic complexity of domination and variants on cocomparability graphs, a class of perfect graphs containing both the interval and the permutation graphs. Minimum dominating total dominating, connected dominating, and independent dominating sets can be constructed in polynomial time. On the other hand. DOMINATING CLIQUE and MINIMUM DOMiNATING CLIQUE remain NP-complete on cocomparability graphs.
引用
收藏
页码：400 / 417
页数：18
相关论文
共 50 条
12345