eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-12-04
21:1
21:12
10.4230/LIPIcs.IPEC.2019.21
article
The Independent Set Problem Is FPT for Even-Hole-Free Graphs
Husić, Edin
1
Thomassé, Stéphan
2
3
Trotignon, Nicolas
4
Department of Mathematics, LSE, Houghton Street, London, WC2A 2AE, United Kingdom
Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, France
Institut Universitaire de France, Paris, France
Univ Lyon, ENS de Lyon, Université Claude Bernard Lyon 1, CNRS, LIP, F-69342, Lyon Cedex 07, France
The class of even-hole-free graphs is very similar to the class of perfect graphs, and was indeed a cornerstone in the tools leading to the proof of the Strong Perfect Graph Theorem. However, the complexity of computing a maximum independent set (MIS) is a long-standing open question in even-hole-free graphs. From the hardness point of view, MIS is W[1]-hard in the class of graphs without induced 4-cycle (when parameterized by the solution size). Halfway of these, we show in this paper that MIS is FPT when parameterized by the solution size in the class of even-hole-free graphs. The main idea is to apply twice the well-known technique of augmenting graphs to extend some initial independent set.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol148-ipec2019/LIPIcs.IPEC.2019.21/LIPIcs.IPEC.2019.21.pdf
independent set
FPT algorithm
even-hole-free graph
augmenting graph