A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A New Perspective on FO Model Checking of Dense Graph Classes

2016
*
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16
*

We study the FO model checking problem of dense graph classes, namely those which are FO-interpretable in some sparse graph classes. Note that if an input dense graph is given together with the corresponding FO interpretation in a sparse graph, one can easily solve the model checking problem using the existing algorithms for sparse graph classes. However, if the assumed interpretation is not given, then the situation is markedly harder. In this paper we give a structural characterization of

doi:10.1145/2933575.2935314
dblp:conf/lics/GajarskyHOLR16
fatcat:ygcxdwpwvvbwnpgd4rz62acemy