时间连通性增强
Temporal Connectivity Augmentation
AI总结:
本文研究时间图中通过添加最少候选时间边实现时间连通的 TCA 问题,证明固定寿命下其 NP 完全性,并给出若干可多项式求解或 NP 难的变体。
摘要:
时间图中的连通性依赖于时间路径这一概念,其中各边遵循时间顺序(严格或非严格)。在本文中,我们研究如何使一个时间图变得连通。更确切地说,我们处理的问题是:在一组给定的候选时间边中,找出最小的子集,使其加入后能让图实现时间连通(TCA)。我们在图的寿命(即图中的最大时间步长)受到限制的情况下,研究该问题及其变体的复杂性。我们关于 TCA 的主要结果是:对于任何至少为 2 的固定寿命,无论在严格还是非严格设定下,该问题都是 NP 完全的。此外,我们在非严格设定下给出了一组限制条件,使该问题可在多项式时间内求解,并设计了达到这一复杂度的算法。有趣的是,我们证明源点变体(使给定顶点成为增强图中的源点)与 TCA 同样困难。相反,我们证明当连通性需求列表的规模固定时,必须满足该列表的版本可在多项式时间内求解。最后,我们指出前一种情形的一个变体:即使只有两对,该问题也已经是 NP 难的。
英文摘要:
Connectivity in temporal graphs relies on the notion of temporal paths, in which edges follow a chronological order (either strict or non-strict). In this work, we investigate the question of how to make a temporal graph connected. More precisely, we tackle the problem of finding, among a set of proposed temporal edges, the smallest subset such that its addition makes the graph temporally connected (TCA). We study the complexity of this problem and variants, under restricted lifespan of the graph, i.e. the maximum time step in the graph. Our main result on TCA is that for any fixed lifespan at least 2, it is NP-complete in both the strict and non-strict setting. We additionally provide a set of restrictions in the non-strict setting which makes the problem solvable in polynomial time and design an algorithm achieving this complexity. Interestingly, we prove that the source variant (making a given vertex a source in the augmented graph) is as difficult as TCA. On the opposite, we prove that the version where a list of connectivity demands has to be satisfied is solvable in polynomial time, when the size of the list is fixed. Finally, we highlight a variant of the previous case for which even with two pairs the problem is already NP-hard.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。