FO model checking on geometric graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00107234" target="_blank" >RIV/00216224:14330/19:00107234 - isvavai.cz</a>
Result on the web
<a href="https://arxiv.org/abs/1709.03701" target="_blank" >https://arxiv.org/abs/1709.03701</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.comgeo.2018.10.001" target="_blank" >10.1016/j.comgeo.2018.10.001</a>
Alternative languages
Result language
angličtina
Original language name
FO model checking on geometric graphs
Original language description
Over the past two decades the main focus of research into first-order (FO) model checking algorithms has been on sparse relational structures – culminating in the FPT algorithm by Grohe, Kreutzer and Siebertz for FO model checking of nowhere dense classes of graphs. On contrary to that, except the case of locally bounded clique-width only little is currently known about FO model checking of dense classes of graphs or other structures. We study the FO model checking problem for dense graph classes definable by geometric means (intersection and visibility graphs). We obtain new nontrivial FPT results, e.g., for restricted subclasses of circular-arc, circle, box, disk, and polygon-visibility graphs. These results use the FPT algorithm by Gajarský et al. for FO model checking of posets of bounded width. We also complement the tractability results by related hardness reductions.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA17-00837S" target="_blank" >GA17-00837S: Structural properties, parameterized tractability and hardness in combinatorial problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2019
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
Name of the periodical
Computational geometry
ISSN
0925-7721
e-ISSN
—
Volume of the periodical
78
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
19
Pages from-to
1-19
UT code for WoS article
000452943900001
EID of the result in the Scopus database
2-s2.0-85055655920