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

同时区间图

Simultaneous Interval Graphs

Krishnam Raju Jampani, Anna Lubiw

摘要:

在最近的一篇论文中,我们介绍了同时表示问题(定义为任何图类C),并研究了弦,可比性和置换图的问题。对于区间图,问题定义如下。如果两个区间图G_1和G_2存在区间表示R_1和R_2,使得I的任意顶点映射到R_1和R_2中的同一区间,则称两个区间图G_1和G_2为“同时区间图”。等价地,如果G_1-I和G_2-I之间存在边E',使得G_1 \cup G_2 \cup E'是区间图,则G_1和G_2是同时区间图。同时表示问题与同时平面嵌入有关,并且在希望一致地表示两个相关图的任何情况下都有应用,例如:间隔图捕获两个相似生物体的DNA片段的重叠;或者在时间上连接的图,其中一个是另一个的更新版本。本文给出了一个时间复杂度为O(n^2*logn)的同时区间图识别算法,其中n =| G_1 \cup G_2|.这一结果补充了用于识别探测区间图的多项式时间算法,并为区间图三明治问题提供了一个有效的算法,特别是当任意边集诱导出完全二部图时.

英文摘要:

In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two interval graphs G_1 and G_2, sharing some vertices I (and the corresponding induced edges), are said to be `simultaneous interval graphs' if there exist interval representations R_1 and R_2 of G_1 and G_2, such that any vertex of I is mapped to the same interval in both R_1 and R_2. Equivalently, G_1 and G_2 are simultaneous interval graphs if there exist edges E' between G_1-I and G_2-I such that G_1 \cup G_2 \cup E' is an interval graph. Simultaneous representation problems are related to simultaneous planar embeddings, and have applications in any situation where it is desirable to consistently represent two related graphs, for example: interval graphs capturing overlaps of DNA fragments of two similar organisms; or graphs connected in time, where one is an updated version of the other. In this paper we give an O(n^2*logn) time algorithm for recognizing simultaneous interval graphs,where n = |G_1 \cup G_2|. This result complements the polynomial time algorithms for recognizing probe interval graphs and provides an efficient algorithm for the interval graph sandwich problem for the special case where the set of optional edges induce a complete bipartite graph.

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

↑