arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.6043cs.DMcs.LO
收藏

区间图的FO模型检验

FO Model Checking of Interval Graphs

Robert Ganian, Petr Hlineny, Daniel Kral, Jan Obdrzalek, Jarett Schwartz, Jakub Teska

摘要:

我们研究了区间图上FO模型检验问题的计算复杂性,即,实数直线上区间的交图。主要的积极结果是,FO模型检验和后继不变的FO模型检验可以解决时间O(n log n)的n-顶点区间图的表示只包含从一个指定的有限集的长度的区间。我们补充这一结果表明,同样是不正确的,如果长度限制到任何集,是密集的一个开放的子集,例如,在集合$(1, 1 + \varepsilon)$中。

英文摘要:

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 + \varepsilon)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑