arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.07530cs.DScs.DM
收藏

稠密图类中的目标集选择

Target Set Selection in Dense Graph Classes

Pavel Dvořák, Dušan Knop, Tomáš Toufar

摘要:

在本文中,我们研究的目标集选择问题,从参数化的复杂性的角度来看。在这里,对于给定的图和每个顶点的阈值,任务是找到一组顶点(称为目标集),其在以下迭代过程中激活整个图。如果一个顶点的邻域中到目前为止激活的顶点的数量至少是它的阈值,则活动集之外的顶点变为活动的。我们给出了两个参数化算法的一个特殊情况下,每个顶点的阈值设置为一半的邻居(所谓的多数目标集选择问题)的参数化的邻域多样性和双覆盖数的输入图。我们从消极的一面补充这些结果。我们给出了一个硬度证明的多数目标集选择问题时,参数化(限制)的模块宽度-一个自然的推广,以前的结构参数。我们还证明了当阈值没有限制时,由邻域多样性或孪生覆盖数参数化的目标集选择问题是W[1]-hard的。

英文摘要:

In this paper, we study the Target Set Selection problem from a parameterized complexity perspective. Here for a given graph and a threshold for each vertex, the task is to find a set of vertices (called a target set) which activates the whole graph during the following iterative process. A vertex outside the active set becomes active if the number of so far activated vertices in its neighborhood is at least its threshold. We give two parameterized algorithms for a special case where each vertex has the threshold set to the half of its neighbors (the so-called Majority Target Set Selection problem) for parameterizations by the neighborhood diversity and the twin cover number of the input graph. We complement these results from the negative side. We give a hardness proof for the Majority Target Set Selection problem when parameterized by (a restriction of) the modular-width - a natural generalization of both previous structural parameters. We also show the Target Set Selection problem parameterized by the neighborhood diversity or by the twin cover number is W[1]-hard when there is no restriction on the thresholds.

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

↑