A linear kernel for a planar connected dominating set

Theoretical Computer Science

Volumn 412, Issue 23, 2011, Pages 2536-2543

  Lokshtanov, Daniel ^a   Mnich, Matthias ^b   Saurabh, Saket ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Connected dominating set; Kernelization; Planar graphs; Reduce or refine

Indexed keywords

CONNECTED DOMINATING SET; INPUT GRAPHS; KERNELIZATION; LINEAR KERNEL; PLANAR GRAPH; POLYNOMIAL-TIME; REDUCE OR REFINE; REDUCTION RULES;

DATA REDUCTION; GRAPH THEORY; POLYNOMIAL APPROXIMATION; REFINING;

GRAPHIC METHODS;

EID: 79954575970     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.10.045     Document Type: Article

References (19)

1. J. Alber, M.R. Fellows, and R. Niedermeier Polynomial-time data reduction for dominating set J. ACM 51 3 2004 363 384 (electronic)
2. N. Alon, S. Gutner, Kernels for the dominating set problem on graphs with an excluded minor, Technical report, ECCC Report TR08-066, 2008.
3. H.L. Bodlaender, F.V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, D.M. Thilikos, (Meta) Kernelization, in: FOCS, 2009, pp. 629638.
4. H.L. Bodlaender, and E. Penninkx A linear kernel for planar feedback vertex set IWPEC Lecture Notes in Comput. Sci. vol. 5018 2008 Springer Berlin 160 171 (Pubitemid 351775568)
5. H.L. Bodlaender, E. Penninkx, and R.B. Tan A linear kernel for the k-disjoint cycle problem on planar graphs ISAAC Lecture Notes in Comput. Sci. vol. 5369 2008 Springer Berlin 306 317
6. J. Chen, H. Fernau, I.A. Kanj, and G. Xia Parametric duality and kernelization: lower bounds and upper bounds on kernel size SIAM J. Comput. 37 4 2007 1077 1106
7. J. Chen, I.A. Kanj, and W. Jia Vertex cover: further observations and further improvements J. Algorithms 41 2 2001 280 301 (Pubitemid 33665542)
8. E.D. Demaine, and M. Hajiaghayi Bidimensionality: new connections between FPT algorithms and PTASs Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms 2005 ACM New York 590 601 (electronic) (Pubitemid 40851417)
9. n Algorithmica 52 2 2008 153 166
10. F.V. Fomin, D. Lokshtanov, S. Saurabh, D.M. Thilikos, Bidimensionality and Kernels, in: SODA, 2010, pp. 503510.
11. M.R. Garey, and D.S. Johnson A guide to the theory of NP-completeness Computers and Intractability A Series of Books in the Mathematical Sciences 1979 W.H. Freeman and Co. San Francisco, Calif
12. Q. Gu, and N. Imani Connectivity is not a limit for kernelization: planar connected dominating set LATIN Lecture Notes in Computer Science vol. 6034 2010 26 37
13. S. Guha, and S. Khuller Approximation algorithms for connected dominating sets Algorithmica 20 4 1998 374 387 (Pubitemid 128664048)
14. J. Guo, Private communication, 2007.
15. J. Guo, and R. Niedermeier Linear problem kernels for NP-hard problems on planar graphs ICALP Lecture Notes in Comput. Sci. vol. 4596 2007 Springer Berlin 375 386
16. J. Guo, R. Niedermeier, and S. Wernicke Fixed-parameter tractability results for full-degree spanning tree and its dual IWPEC Lecture Notes in Comput. Sci. vol. 4169 2006 Springer Berlin 203 214 (Pubitemid 44609925)
17. S. Gutner Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor IWPEC Lecture Notes in Computer Science vol. 5917 2009 246 257
18. H. Moser, and S. Sikdar The parameterized complexity of the induced matching problem in planar graphs FAW Lecture Notes in Comput. Sci. vol. 4613 2007 Springer Berlin 325 336
19. S. Thomass A quadratic kernel for feedback vertex set Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms 2009 ACM New York 115 119 (electronic)