| GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, 4:11, s. 1-20. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(4:11)2015. |
Další formáty:
BibTeX
LaTeX
RIS
@article{1323000,
author = {Ganian, Robert and Hliněný, Petr and Kráľ, Daniel and Obdržálek, Jan and Schwartz, Jarett and Teska, Jakub},
article_location = {Německo},
article_number = {4:11},
doi = {http://dx.doi.org/10.2168/LMCS-11(4:11)2015},
keywords = {rst-order model checking; parameterized complexity; interval graph; clique-width},
language = {eng},
issn = {1860-5974},
journal = {Logical Methods in Computer Science},
title = {FO Model Checking of Interval Graphs},
url = {http://arxiv.org/pdf/1302.6043.pdf},
volume = {11},
year = {2015}
}
TY - JOUR
ID - 1323000
AU - Ganian, Robert - Hliněný, Petr - Kráľ, Daniel - Obdržálek, Jan - Schwartz, Jarett - Teska, Jakub
PY - 2015
TI - FO Model Checking of Interval Graphs
JF - Logical Methods in Computer Science
VL - 11
IS - 4:11
SP - 1-20
EP - 1-20
PB - Logical Methods in Computer Science e.V.
SN - 18605974
KW - rst-order model checking
KW - parameterized complexity
KW - interval graph
KW - clique-width
UR - http://arxiv.org/pdf/1302.6043.pdf
N2 - We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that FO model checking and successor-invariant FO model checking can be solved in time O(n log n) for n-vertex interval graphs with representations containing only intervals with lengths from a prescribed finite set. We complement this result by showing that the same is not true if the lengths are restricted to any set that is dense in an open subset, e.g., in the set (1, 1 + µ).
ER -
GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. \textit{Logical Methods in Computer Science}. Německo: Logical Methods in Computer Science e.V., 2015, roč.~11, 4:11, s.~1-20. ISSN~1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(4:11)2015.
|
