论文信息 - Parameterized complexity of k-tuple and liar's domination - 字舞流文

Parameterized complexity of k-tuple and liar's domination

Arijit Ghosh | Arijit Bishnu | Subhabrata Paul

[1] Frank Harary,et al. Double Domination in Graphs , 2000, Ars Comb..

[2] Peter J. Slater,et al. Liar's domination in graphs , 2009, Discret. Math..

[3] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[4] Rolf Niedermeier,et al. Polynomial-time data reduction for dominating set , 2002, JACM.

[5] Bhawani Sankar Panda,et al. A linear time algorithm for liar's domination problem in proper interval graphs , 2013, Inf. Process. Lett..

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .

[8] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .

[9] Rolf Niedermeier,et al. Refined Search Tree Technique for DOMINATING SET on Planar Graphs , 2001, MFCS.

[10] Chung-Shou Liao,et al. K-tuple Domination in Graphs , 2003, Inf. Process. Lett..

[11] Dimitrios M. Thilikos,et al. Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up , 2004, ICALP.

[12] P. Slater. Liar's domination , 2009 .

[13] Rolf Niedermeier,et al. Parameterized complexity: exponential speed-up for planar graph problems , 2004, J. Algorithms.

[14] Bhawani Sankar Panda,et al. Liar's domination in graphs: Complexity and algorithm , 2013, Discret. Appl. Math..

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