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

简单几何网络中目标集选择问题的复杂性

On the Complexity of Target Set Selection in Simple Geometric Networks

Michal Dvořák, Dušan Knop, Šimon Schierreich

AI总结:

本文研究几何交图网络中目标集选择问题的计算复杂性,证明在单位圆盘图上该问题已属困难,并进一步在区间图和网格图等更简单的几何图类上寻求算法结果。

摘要:

我们研究以下社交网络中的疾病传播模型。起初,所有个体要么已感染,要么健康。接下来,在离散轮次中,疾病在网络中从已感染个体向健康个体传播,当且仅当一个健康个体的直接邻居中已有足够数量的个体被感染时,该健康个体才会被感染。我们将社交网络表示为图。受当前流行病中现实世界限制的启发,尤其是社交距离和物理距离要求,我们将自己限制在可以表示为几何交图的网络上。我们证明,寻找一个最小的初始感染顶点集以使疾病传播到整个网络在计算上是困难的,即使在单位圆盘图上也是如此。因此,为了提供一些算法结果,我们将重点放在更简单的几何图类上,例如区间图和网格图。

英文摘要:

We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient number of its direct neighbors are already infected. We represent the social network as a graph. Inspired by the real-world restrictions in the current epidemic, especially by social and physical distancing requirements, we restrict ourselves to networks that can be represented as geometric intersection graphs. We show that finding a minimal vertex set of initially infected individuals to spread the disease in the whole network is computationally hard, already on unit disk graphs. Hence, to provide some algorithmic results, we focus ourselves on simpler geometric graph classes, such as interval graphs and grid graphs.

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

↑