A survey of parameterized algorithms and the complexity of edge modification
Peer reviewed, Journal article
Published version
Date
2023Metadata
Show full item recordCollections
Original version
10.1016/j.cosrev.2023.100556Abstract
The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification. The main focus is on edge modification problems, where the task is to change some adjacencies in a graph to satisfy some required properties. To facilitate further research, we list many open problems in the area.