A New Perspective on FO Model Checking of Dense Graph Classes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088546" target="_blank" >RIV/00216224:14330/16:00088546 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/2933575.2935314" target="_blank" >http://dx.doi.org/10.1145/2933575.2935314</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2933575.2935314" target="_blank" >10.1145/2933575.2935314</a>
Alternative languages
Result language
angličtina
Original language name
A New Perspective on FO Model Checking of Dense Graph Classes
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA14-03501S" target="_blank" >GA14-03501S: Parameterized algorithms and kernelization in the context of discrete mathematics and logic</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016
ISBN
9781450343916
ISSN
1043-6871
e-ISSN
—
Number of pages
9
Pages from-to
176-184
Publisher name
ACM
Place of publication
New York, NY, USA
Event location
New York, NY, USA
Event date
Jul 5, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—