收缩边以破坏一种模式:一项复杂性研究
Contracting edges to destroy a pattern: A complexity study
AI总结:
本文研究通过至多 k 次边收缩消除图中诱导 H 的 H-free Contraction,刻画其 NP 完全性,并证明除七棵树外树目标 H 均导致 W[2]-难,仅剩三个开放情形。
摘要:
给定一个图 G 和一个整数 k,$\Pi$-Contraction($\Pi$ 收缩)问题的目标是检查 G 中是否存在至多 k 条边,使得在 G 中收缩这些边后所得的图满足性质 $\Pi$。我们研究 $\Pi$ 为“H-free(不含 H)”(即不含 H 的任何诱导副本)的问题。显而易见,当 H 是至多两个顶点的完全图时,H-free Contraction 可在多项式时间内求解。我们证明,在所有其他情况下,该问题都是 NP 完全的。随后,我们研究这些问题的固定参数可处理性。我们证明,只要 H 是一棵树,除七棵树外,H-free Contraction 都是 W[2]-难的。该结果与已知结果一起,在树中留下了三个未知情形。
英文摘要:
Given a graph G and an integer k, the objective of the $Π$-Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a graph satisfying the property $Π$. We investigate the problem where $Π$ is `H-free' (without any induced copies of H). It is trivial that H-free Contraction is polynomial-time solvable if H is a complete graph of at most two vertices. We prove that, in all other cases, the problem is NP-complete. We then investigate the fixed-parameter tractability of these problems. We prove that whenever H is a tree, except for seven trees, H-free Contraction is W[2]-hard. This result along with the known results leaves behind three unknown cases among trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。