On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
Data Structures and Algorithms
2019-02-27 v4 Computational Complexity
Abstract
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 \phi for the problem to be fixed-parameter tractable or to admit a polynomial kernel.
Cite
@article{arxiv.1805.04375,
title = {On the Parameterized Complexity of Graph Modification to First-Order Logic Properties},
author = {Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos},
journal= {arXiv preprint arXiv:1805.04375},
year = {2019}
}