The independent set problem is FPT for even-hole-free graphs
From MaRDI portal
Publication:6321384
DOI10.4230/LIPICS.IPEC.2019.21arXiv1907.01083MaRDI QIDQ6321384
Nicolas Trotignon, Steéphan Thomassé, Edin Husić
Publication date: 1 July 2019
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: The independent set problem is FPT for even-hole-free graphs