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.
机构:
INDIAN INST TECHNOL, DEPT COMP SCI & ENGN, MADRAS 600036, TAMIL NADU, INDIAINDIAN INST TECHNOL, DEPT COMP SCI & ENGN, MADRAS 600036, TAMIL NADU, INDIA
CHANG, GJ
RANGAN, CP
论文数: 0引用数: 0
h-index: 0
机构:
INDIAN INST TECHNOL, DEPT COMP SCI & ENGN, MADRAS 600036, TAMIL NADU, INDIAINDIAN INST TECHNOL, DEPT COMP SCI & ENGN, MADRAS 600036, TAMIL NADU, INDIA
RANGAN, CP
COORG, SR
论文数: 0引用数: 0
h-index: 0
机构:
INDIAN INST TECHNOL, DEPT COMP SCI & ENGN, MADRAS 600036, TAMIL NADU, INDIAINDIAN INST TECHNOL, DEPT COMP SCI & ENGN, MADRAS 600036, TAMIL NADU, INDIA