arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.3443cs.DM
收藏

单位区间图和单位圆弧图的有界、极小和短表示

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs

Francisco J. Soulignac

摘要:

本文研究了单位区间图(UIG)和单位圆弧图(UCA)的无限制、极小和有界表示问题。在非限制型的情况下,给出了一个适当的圆弧(PCA)模型$\cal M$,目标是得到一个等价的UCA模型$\cal U$ .我们展示了一个线性时间算法,也可以实现在对数空间中运行的负认证。在有界形式中,给出了$\cal M$以及$\cal U$的起始点必须满足的上下界。我们开发了一个线性空间$O(n^2)$时间算法。最后,在最小的版本中,圆的周长和$\cal U$中弧的长度必须同时尽可能最小。我们证明了每个UCA图都存在这样的极小模型,并给出了求极小模型的多项式时间算法,我们还考虑了UIG图的极小表示问题。作为一个坏的结果,我们表明,以前的线性时间算法未能提供一个最小的模型,一些输入图。我们修正了这个算法,但不幸的是,它运行在线性空间$O(n^2)$时间。最后,我们应用最小表示算法,以找到最小功率的路径和循环,分别包含一个给定的UIG和UCA模型。

英文摘要:

We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) model $\cal M$ is given and the goal is to obtain an equivalent UCA model $\cal U$. We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version, $\cal M$ is given together with some lower and upper bounds that the beginning points of $\cal U$ must satisfy. We develop a linear space $O(n^2)$ time algorithm for this problem. Finally, in the minimal version, the circumference of the circle and the length of the arcs in $\cal U$ must be simultaneously as minimum as possible. We prove that every UCA graph admits such a minimal model, and give a polynomial time algorithm to find it. We also consider the minimal representation problem for UIG graphs. As a bad result, we show that the previous linear time algorithm fails to provide a minimal model for some input graphs. We fix this algorithm but, unfortunately, it runs in linear space $O(n^2)$ time. Finally, we apply the minimal representation algorithms so as to find the minimum powers of paths and cycles that contain a given UIG and UCA models, respectively.

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

↑