Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Data Structures and Algorithms
2022-03-01 v1 Discrete Mathematics
Logic in Computer Science
Combinatorics
Abstract
We present a fixed-parameter tractable algorithm for first-order model checking on interpretations of graph classes with bounded local cliquewidth. Notably, this includes interpretations of planar graphs, and more generally, of classes of bounded genus. To obtain this result we develop a new tool which works in a very general setting of dependent classes and which we believe can be an important ingredient in achieving similar results in the future.
Cite
@article{arxiv.2202.13014,
title = {Model Checking on Interpretations of Classes of Bounded Local Cliquewidth},
author = {Édouard Bonnet and Jan Dreier and Jakub Gajarský and Stephan Kreutzer and Nikolas Mählmann and Pierre Simon and Szymon Toruńczyk},
journal= {arXiv preprint arXiv:2202.13014},
year = {2022}
}
Comments
28 pages, 5 figures