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

一类无$H$边删除问题的参数化下界和NP完全性

Parameterized lower bound and NP-completeness of some $H$-free Edge Deletion problems

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

摘要:

对于图$H$,无$H$边删除问题询问是否存在最多$k$边,其从输入图$G$中删除导致图没有任何$H$的诱导副本。证明了$H$ -free边删除是NP-完全的,如果$H$是一个至少有两条边的图,并且$H$有一个顶点数最多的分支是树或正则图.此外,我们得到这些NP完全问题不能在参数化的次指数时间内求解,即,在时间$2^{o(k)}\cdot |G|^{O(1)}$,除非指数时间假设失败。

英文摘要:

For a graph $H$, the $H$-free Edge Deletion problem asks whether there exist at most $k$ edges whose deletion from the input graph $G$ results in a graph without any induced copy of $H$. We prove that $H$-free Edge Deletion is NP-complete if $H$ is a graph with at least two edges and $H$ has a component with maximum number of vertices which is a tree or a regular graph. Furthermore, we obtain that these NP-complete problems cannot be solved in parameterized subexponential time, i.e., in time $2^{o(k)}\cdot |G|^{O(1)}$, unless Exponential Time Hypothesis fails.

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

↑