eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-02-05
17:1
17:13
10.4230/LIPIcs.IPEC.2018.17
article
Parameterized Complexity of Independent Set in H-Free Graphs
Bonnet, Édouard
1
Bousquet, Nicolas
2
Charbit, Pierre
3
Thomassé, Stéphan
4
Watrigant, Rémi
1
Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, France
CNRS, G-SCOP laboratory, Grenoble-INP, France
Université Paris Diderot, IRIF, France
Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, France, Institut Universitaire de France
In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of H-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given that the problem remains NP-hard for most graphs H, we study its fixed-parameter tractability and make progress towards a dichotomy between FPT and W[1]-hard cases. We first show that MIS remains W[1]-hard in graphs forbidding simultaneously K_{1, 4}, any finite set of cycles of length at least 4, and any finite set of trees with at least two branching vertices. In particular, this answers an open question of Dabrowski et al. concerning C_4-free graphs. Then we extend the polynomial algorithm of Alekseev when H is a disjoint union of edges to an FPT algorithm when H is a disjoint union of cliques. We also provide a framework for solving several other cases, which is a generalization of the concept of iterative expansion accompanied by the extraction of a particular structure using Ramsey's theorem. Iterative expansion is a maximization version of the so-called iterative compression. We believe that our framework can be of independent interest for solving other similar graph problems. Finally, we present positive and negative results on the existence of polynomial (Turing) kernels for several graphs H.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol115-ipec2018/LIPIcs.IPEC.2018.17/LIPIcs.IPEC.2018.17.pdf
Parameterized Algorithms
Independent Set
H-Free Graphs