Parameterized complexity in multiple-interval graphs: domination
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation（2011）
摘要
We show that several variants of the problem k-Dominating Set, including k-Connected Dominating Set, k-Independent Dominating Set, k-Dominating Clique, d-Distancek-Dominating Set, k-Perfect Code and d-Distancek-Perfect Code, when parameterized by the solution size k, remain W[1]-hard in either multiple-interval graphs or their complements or both.
更多查看译文
关键词
d-distancek-dominating set,multiple-interval graph,k-dominating clique,k-perfect code,parameterized complexity,solution size k,d-distancek-perfect code
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要