A survey of parameterized algorithms and the complexity of edge modification
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
Abstract
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.
Topics & Concepts
KernelizationParameterized complexityComputer scienceAlgorithmGraphTheoretical computer scienceEnhanced Data Rates for GSM EvolutionArtificial intelligenceAdvanced Graph Theory ResearchProtein Degradation and InhibitorsCancer-related gene regulation