Parameterized Complexity of Elimination Distance to First-Order Logic Properties

The elimination distance to some target graph property {\mathcal{P}} is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic. We delimit the problem's fixed-parameter tractabili...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Fomin, Fedor V., Golovach, Petr A., Thilikos, Dimitrios M.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Complexity theory Computer science descriptive complexity elimination distance first-order logic parameterized complexity
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!