A survey of parameterized algorithms and the complexity of edge modification
arXiv:2001.06867
Abstract
The survey provides an overview of the developing area of parameterized algorithms for graph modification problems. We concentrate on edge modification problems, where the task is to change a small number of adjacencies in a graph in order to satisfy some required property.
Incorporated comments from Marcin Pilipczuk, William Lochet, and Dekel Tsur