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.
@article{arxiv.2001.06867,
title = {A survey of parameterized algorithms and the complexity of edge modification},
author = {Christophe Crespelle and Pål Grønås Drange and Fedor V. Fomin and Petr A. Golovach},
journal= {arXiv preprint arXiv:2001.06867},
year = {2020}
}
Comments
Incorporated comments from Marcin Pilipczuk, William Lochet, and Dekel Tsur