Kernelization hardness of connectivity problems in d-degenerate graphs

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

Volumn 6410 LNCS, Issue , 2010, Pages 147-158

  Cygan, Marek ^a   Pilipczuk, Marcin ^a   Pilipczuk, Michał ^a   Wojtaszczyk, Jakub Onufry ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BICLIQUE; COMPLEXITY ASSUMPTIONS; CONNECTED DOMINATING SET; CONNECTED VERTEX COVER; CONNECTIVITY PROBLEMS; DOMINATING SETS; FEEDBACK VERTEX SET; KERNELIZATION; NP-HARD; ODD CYCLE; PLANAR GRAPH; POLYNOMIAL HIERARCHIES; POLYNOMIAL KERNELS; SET COVER; STEINER TREES; SUBGRAPHS; THIRD LEVEL;

APPROXIMATION ALGORITHMS; BIOINFORMATICS; COMPUTER SCIENCE; GRAPHIC METHODS; HARDNESS; POLYNOMIALS; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 78650183811     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16926-7_15     Document Type: Conference Paper

References (19)

1. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 394-405. Springer, Heidelberg (2007)
2. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563-574. Springer, Heidelberg (2008)
3. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M. (Meta) kernelization. In: Proc. of FOCS 2009, pp. 629-638 (2009)
4. Bodlaender, H.L., Thomasse, S., Yeo, A.: Analysis of data reduction: Transformations give evidence for non-existence of polynomial kernels, technical Report UU-CS-2008-030, Institute of Information and Computing Sciences, Utrecht University, Netherlands (2008)
5. Chen, J., Kanj, I.A., Jia,W.: Vertex cover: Further observations and further improvements. J. Algorithms 41(2), 280-301 (2001) (Pubitemid 33665542)
6. Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Proc. of ICALP 2009, pp. 378-389 (2009)
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999), http://citeseer.ist.psu.edu/downey98parameterized.html
8. Escoffier, B., Gourvès, L., Monnot, J.: Complexity and approximation results for the connected vertex cover problem. In: Brandstädt, A., Kratsch, D., Müller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 202-213. Springer, Heidelberg (2007)
9. Fellows,M.R., Fertin, G., Hermelin, D., Vialette, S.: Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 340-351. Springer, Heidelberg (2007)
10. Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: On out-trees with many leaves. In: Proc. of STACS 2009, pp. 421-432 (2009)
11. Fomin, F., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Proc. of SODA 2010, pp. 503-510 (2010)
12. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: Proc. of STOC 2008, pp. 133-142 (2008)
13. Golovach, P.A., Villanger, Y.: Parameterized complexity for domination problems on degenerate graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 195-205. Springer, Heidelberg (2008)
14. Kostochka, A.V.: Lower bound of the hadwiger number of graphs by their average degree. Combinatorica 4(4), 307-316 (1984)
15. Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT Algorithms for Connected Feedback Vertex Set. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 269-280. Springer, Heidelberg (2010)
16. Philip, G., Raman, V., Sikdar, S.: Solving dominating set in larger classes of graphs: Fpt algorithms and polynomial kernels. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 694-705. Springer, Heidelberg (2009)
17. Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95(2), 261-265 (1984)
18. Thomason, A.: The extremal function for complete minors. J. Comb. Theory, Ser. B 81(2), 318-338 (2001)
19. Thomassé, S.: A quadratic kernel for feedback vertex set. In: Proc. of SODA 2009, pp. 115-119 (2009)