Simpler linear-time kernelization for planar dominating set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7112 LNCS, Issue , 2012, Pages 181-193

  Hagerup, Torben ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DOMINATING SETS; DOMINATION NUMBER; KERNELIZATION; LINEAR-TIME ALGORITHMS; NP COMPLETE; PARAMETERIZED COMPUTATION; PLANAR DOMINATING SET; PLANAR GRAPH;

CLUSTERING ALGORITHMS; GRAPHIC METHODS; PARAMETERIZATION;

GRAPH THEORY;

EID: 84858405972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28050-4_15     Document Type: Conference Paper

References (11)

1. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for Dominating Set. J. ACM 51(3), 363-384 (2004)
2. van Bevern, R., Hartung, S., Kammer, F., Niedermeier, R., Weller, M.: Linear-time computation of a linear problem kernel for Dominating Set on planar graphs. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 194-206. Springer, Heidelberg (2012)
3. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: FOCS, pp. 629-638. IEEE Computer Society (2009)
4. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM J. Comput. 37(4), 1077-1106 (2007)
5. Guo, J., Niedermeier, R.: Linear problem kernels for NP-hard problems on planar graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 375-386. Springer, Heidelberg (2007)
6. Jansen, B.: Kernelization for Maximum Leaf Spanning Tree with positive vertex weights. In: Calamoneri, T., Díaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 192-203. Springer, Heidelberg (2010)
7. Kammer, F.: A linear-time algorithm to find a kernel for the Rooted Leaf Out-branching problem (2011) (manuscript)
8. Kloks, T., Lee, C.M., Liu, J.: New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 282-295. Springer, Heidelberg (2002) (Pubitemid 36140607)
9. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
10. Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Dover Publications, Inc., Mineola (1988)
11. Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applyingmodular decomposition to parameterized cluster editing problems. Theory Comput. Syst. 44(1), 91-104 (2009)