Talks and Poster Presentations (with Proceedings-Entry):
J. Gajarsky, P. Hlinený, J. Obdrzalek, D. Lokshtanov, M. S. Ramanujan:
"A New Perspective on FO Model Checking of Dense Graph Classes";
Talk: Symposium on Logic in Computer Science (LICS),
New York, USA;
- 2016-07-08; in: "Proceedings of the 31st Annual Symposium on Logic in Computer Science",
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 graph classes which are FO interpretable in graph classes of bounded degree. This characterization allows us to efficiently compute such an interpretation for an input graph. As a consequence, we obtain an FPT algorithm for FO model checking of graph classes FO interpretable in graph classes of bounded degree. The approach we use to obtain these results may also be of independent interest.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.