arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.10814cs.DS
收藏

时间可达性最小化:延迟与删除

Temporal Reachability Minimization: Delaying vs. Deleting

Hendrik Molter, Malte Renken, Philipp Zschoche

摘要:

我们研究了时间图中的扩散过程,即。例如,连接随时间变化的图形。这些过程自然地模拟了现实世界的现象,如传染病或信息流。更确切地说,我们调查如何这样的传播过程中,出现从一组给定的源,可以包含到一小部分的图。为此,我们考虑两种修改图的方法,即(1)删除连接和(2)延迟连接。我们指出了这两个问题之间的密切关系,并在图具有树结构的情况下给出了一个多项式时间算法。对于一般的版本,我们考虑参数化的顶点数的蔓延。令人惊讶的是,我们证明了W[1]-硬度的删除变体,但固定参数的易处理性的延迟变体。

英文摘要:

We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how such a spreading process, emerging from a given set of sources, can be contained to a small part of the graph. To this end we consider two ways of modifying the graph, which are (1) deleting connections and (2) delaying connections. We show a close relationship between the two associated problems and give a polynomial time algorithm when the graph has tree structure. For the general version, we consider parameterization by the number of vertices to which the spread is contained. Surprisingly, we prove W[1]-hardness for the deletion variant but fixed-parameter tractability for the delaying variant.

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

↑