arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.01162cs.DS
收藏

单位间隔顶点删除:相关顶点较少

Unit Interval Vertex Deletion: Fewer Vertices are Relevant

Yuping Ke, Yixin Cao, Xiating Ouyang, Jianxin Wang

摘要:

单位区间顶点删除问题要求一个至多包含$k$顶点的集合,该集合从一个$n$ -顶点图中删除使其成为一个单位区间图.我们为该问题开发了一个$O(k^4)$ -顶点内核,显著改进了Fomin,Saurabh和Villanger的$O(k^{53})$ -顶点内核[ESA'12; SIAM J.离散数学27(2013)]。我们介绍了一种新的方法来组织团的单位区间图。我们的算法的正确性的建设性证明,使用区间模型,大大简化了破坏性的证明,基于禁止诱导子图,在文献中类似的问题。

英文摘要:

The unit interval vertex deletion problem asks for a set of at most $k$ vertices whose deletion from an $n$-vertex graph makes it a unit interval graph. We develop an $O(k^4)$-vertex kernel for the problem, significantly improving the $O(k^{53})$-vertex kernel of Fomin, Saurabh, and Villanger [ESA'12; SIAM J. Discrete Math 27(2013)]. We introduce a novel way of organizing cliques of a unit interval graph. Our constructive proof for the correctness of our algorithm, using interval models, greatly simplifies the destructive proofs, based on forbidden induced subgraphs, for similar problems in literature.

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

↑