Affordable Access

FO model checking of interval graphs

Springer Berlin Heidelberg
Publication Date
  • Computer Science
  • Mathematics


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 logn) 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 + ε).

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

Model checking and boolean graphs

on Theoretical Computer Science Jan 01, 1994

Short Models for Unit Interval Graphs

on Electronic Notes in Discrete M... Jan 01, 2009
More articles like this..