arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.08705math.CO
收藏

给你的树接种疫苗!

Vaccinate your trees!

Stefan Ehard, Dieter Rautenbach

摘要:

对于图$G$和其顶点集上的整数值函数$τ$,动态垄断是$G$的顶点集,使得迭代地将其中至少具有$τ(u)$邻居的$G$的顶点$u$添加到它,最终产生$G$的顶点集。我们研究了两个疫苗接种问题,其目标是最大限度地提高这样一个动态垄断的最小顺序,无论是通过增加阈值的$b$顶点超过他们的程度,或通过删除$b$顶点从$G$,其中$b$是一个给定的非负整数对应的预算。我们展示了如何有效地解决这些问题的树木。

英文摘要:

For a graph $G$ and an integer-valued function $τ$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $τ(u)$ neighbors in it eventually yields the vertex set of $G$. We study two vaccination problems, where the goal is to maximize the minimum order of such a dynamic monopoly either by increasing the threshold value of $b$ vertices beyond their degree, or by removing $b$ vertices from $G$, where $b$ is a given non-negative integer corresponding to a budget. We show how to solve these problems efficiently for trees.

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

↑