On the Parameterized Complexity of Graph Modification to First-Order Logic Properties

05/11/2018

∙

by   Fedor V. Fomin, et al.

∙

0

∙

share

We consider the problems of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the result of the modification satisfies some property definable in first-order logic. We establish a number of sufficient and necessary conditions on the quantification pattern of the first-order formula ϕ for the problem to be fixed-parameter tractable or to admit a polynomial kernel.