A New Perspective on FO Model Checking of Dense Graph Classes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00114779" target="_blank" >RIV/00216224:14330/20:00114779 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/3383206" target="_blank" >http://dx.doi.org/10.1145/3383206</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3383206" target="_blank" >10.1145/3383206</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A New Perspective on FO Model Checking of Dense Graph Classes

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

A New Perspective on FO Model Checking of Dense Graph Classes

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA17-00837S" target="_blank" >GA17-00837S: Strukturální vlastnosti, parametrizovaná řešitelnost a těžkost v kombinatorických problémech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

ACM Transactions on Computational Logic

ISSN

1529-3785

e-ISSN

1557-945X

Svazek periodika

21

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

23

Strana od-do

„28:1“-„28:23“

Kód UT WoS článku

000586733900002

EID výsledku v databázi Scopus

2-s2.0-85096593679