arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.6960cs.DMmath.CO
收藏

真图和单位区间图的部分表示的扩展

Extending Partial Representations of Proper and Unit Interval Graphs

Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomáš Vyskočil

摘要:

最近引入的问题,延长部分区间表示要求,为一个区间图与一些间隔预先绘制的输入,部分表示是否可以扩展到整个图的表示。本文给出了扩张真区间表示的线性时间算法和扩张单位区间表示的几乎二次时间算法。我们还介绍了更一般的问题,有界表示的单位区间图,其中的输入约束的位置,一些区间的下限和上限。我们表明,这个问题是NP-完全的不连通的输入图,并给出了一个多项式时间算法的特殊类的情况下,其中输入图的连接组件沿实数线的顺序规定。这包括部分表示扩展的情况。硬度的结果形成鲜明对比最近的多项式时间算法有界表示的适当的区间图[Brachio等人。ISAAC'13]。因此,除非有$\text{P} = \text{NP}$,否则真音程和单位音程的表示法在结构上有很大的不同。这解释了为什么这些不同类型的表示的部分表示扩展问题需要实质上不同的技术。

英文摘要:

The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be extended to a representation of the entire graph. In this paper, we give a linear-time algorithm for extending proper interval representations and an almost quadratic-time algorithm for extending unit interval representations. We also introduce the more general problem of bounded representations of unit interval graphs, where the input constrains the positions of some intervals by lower and upper bounds. We show that this problem is NP-complete for disconnected input graphs and give a polynomial-time algorithm for the special class of instances, where the ordering of the connected components of the input graph along the real line is prescribed. This includes the case of partial representation extension. The hardness result sharply contrasts the recent polynomial-time algorithm for bounded representations of proper interval graphs [Balko et al. ISAAC'13]. So unless $\text{P} = \text{NP}$, proper and unit interval representations have vastly different structure. This explains why partial representation extension problems for these different types of representations require substantially different techniques.

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

↑