图收缩为分裂图和阈值图
Contracting Graphs to Split Graphs and Threshold Graphs
摘要:
研究了分裂收缩和阈值收缩的参数化复杂性。在这些问题中,我们给出了一个图G和一个整数k,并询问G是否可以通过收缩至多k条边分别修改为分裂图或阈值图。我们提出了一个FPT分裂收缩算法,并证明了分裂图上的阈值收缩,即,将输入分裂图收缩到阈值图,当由收缩次数参数化时是FPT。为了给一个完整的图片,我们表明,这两个问题承认没有多项式内核,除非NP \subseteq coNP/聚。
英文摘要:
We study the parameterized complexity of Split Contraction and Threshold Contraction. In these problems we are given a graph G and an integer k and asked whether G can be modified into a split graph or a threshold graph, respectively, by contracting at most k edges. We present an FPT algorithm for Split Contraction, and prove that Threshold Contraction on split graphs, i.e., contracting an input split graph to a threshold graph, is FPT when parameterized by the number of contractions. To give a complete picture, we show that these two problems admit no polynomial kernels unless NP\subseteq coNP/poly.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。