关于将顶点分裂为区间图的复杂性
On the Complexity of Vertex-Splitting Into an Interval Graph
AI总结:
研究了通过顶点分裂将图转换为区间图的复杂性,证明了该问题NP难,并给出了多项式时间算法解决特定类型图的转换。
摘要:
顶点分裂是一种图修改操作,其中一个顶点被替换成多个顶点,使得它们的邻域的并集等于原顶点的邻域。我们引入并研究顶点分裂作为图修改操作,用于将图转换为区间图。给定一个图G和一个整数k,我们考虑决定是否可以使用至多k次顶点分裂将G转换为区间图的问题。我们证明了这个问题是NP难的,即使输入被限制在子立方平面双色图中也是如此。我们进一步观察到,当目标是获得一个弦图时,顶点分裂与顶点和边删除作为图修改操作存在根本区别,即使对于最大独立集大小不超过两个的图也是如此。在积极的一面,我们给出了一种多项式时间算法,用于通过最少的顶点分裂将给定的图转换为路径的不相交并集,并且将无三角形图分裂为单位区间图也是可以在多项式时间内解决的。
英文摘要:
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the original vertex. We introduce and study vertex splitting as a graph modification operation for transforming graphs into interval graphs. Given a graph $G$ and an integer $k$, we consider the problem of deciding whether $G$ can be transformed into an interval graph using at most $k$ vertex splits. We prove that this problem is NP-hard, even when the input is restricted to subcubic planar bipartite graphs. We further observe that vertex splitting differs fundamentally from vertex and edge deletions as graph modification operations when the objective is to obtain a chordal graph, even for graphs with maximum independent set size at most two. On the positive side, we give a polynomial-time algorithm for transforming, via a minimum number of vertex splits, a given graph into a disjoint union of paths, and that splitting triangle free graphs into unit interval graphs is also solvable in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。