论文信息 - Parameterized Complexity in Multiple-Interval Graphs: Domination

Parameterized Complexity in Multiple-Interval Graphs: Domination

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.

Yong Zhang | Minghui Jiang

[1] Bin Fu,et al. On recovering syntenic blocks from comparative maps , 2008, J. Comb. Optim..

[2] Michael R. Fellows,et al. Parameterized Complexity , 1998 .

[3] Marco Cesati. Perfect Code is W[1]-complete , 2000, Inf. Process. Lett..

[4] Shi Ying,et al. Frontiers in Algorithmics , 2010, Lecture Notes in Computer Science.

[5] Reuven Bar-Yehuda,et al. Scheduling split intervals , 2002, SODA '02.

[6] Yong Zhang,et al. Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy , 2011, COCOON.

[7] Minghui Jiang. On the parameterized complexity of some optimization problems related to multiple-interval graphs , 2010, Theor. Comput. Sci..

[8] Minghui Jiang. Recognizing d-Interval Graphs and d-Track Interval Graphs , 2010, FAW.

[9] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[10] Minghui Jiang. Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[11] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[12] F. Roberts. Graph Theory and Its Applications to Problems of Society , 1987 .

[13] Moshe Lewenstein,et al. Optimization problems in multiple-interval graphs , 2007, SODA '07.