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.
Universidad de Buenos Aires, Facultad de Ciencias Exactas y Naturales(布宜诺斯艾利斯大学理学院);CONICET-Universidad de Buenos Aires, Instituto de Cálculo (IC)(阿根廷国家科学研究委员会-布宜诺斯艾利斯大学计算研究所);CONICET-Universidad de Buenos Aires, Instituto de Investigación en Ciencias de la Computación (ICC)(阿根廷国家科学研究委员会-布宜诺斯艾利斯大学计算机科学研究所以);Universidad de Chile, Facultad de Ciencias Físicas y Matemáticas(智利大学物理与数学院);School of Informatics, University of Edinburgh(爱丁堡大学信息学院)
Component Coloring of Proper Interval Graphs and Split Graphs
我们介绍了一个推广的著名的图(顶点)着色问题,我们称之为问题的\emph{component coloring of graphs}。给定一个图,问题是用最少的颜色数给顶点着色,使得由相同颜色的顶点诱导的子图的每个连通分支的大小不超过$C$。给出了真区间图上该问题的一个线性时间算法。我们扩展此算法来解决两个加权版本的问题,其中顶点有整数权重。在\emph{splittable}版本中,顶点的权重可以分成不同颜色的部分,但是,单色组件的总权重不能超过$C$。对于这个问题,我们给出了一个多项式时间算法。在\emph{non-splittable}版本中,顶点不能分割。利用可分裂问题的算法,我们给出了NP-困难的真区间图不可分裂问题的一个2-近似算法。我们还证明,即使是未加权版本的问题是NP-困难的分裂图。