Exploring Subexponential Parameterized Complexity of Completion Problems

Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk +1

Let $\mathcal{F}$ be a family of graphs. In the $\mathcal{F}$-Completion problem, we are given a graph $G$ and an integer $k$ as input, and asked whether at most $k$ edges can be added t…