Publication details

FO Model Checking of Interval Graphs

Authors

GANIAN Robert HLINĚNÝ Petr KRÁĽ Daniel OBDRŽÁLEK Jan SCHWARTZ Jarett TESKA Jakub

Type Article in Proceedings
Conference ICALP (2) 2013
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/978-3-642-39212-2_24
Field Informatics
Keywords interval graphs; first-order logic; parameterized complexity
Description 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 this problem 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 some open subset, e.g., in the set (1, 1+epsilon).
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info