等待时间约束下时间路径搜索的计算复杂性
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
摘要:
计算两个顶点之间的(短)路是图算法中最基本的基元之一。近年来,时态图(即顶点集固定而边集随时间变化的图)中的路的研究得到了越来越多的关注。如果路径使用具有非递减时间戳的边,则它是时间相关的或时间的。我们调查的时间路径的基本约束,在每个顶点所花费的时间不得超过一个给定的持续时间$Δ$,称为$Δ$ -不安分的时间路径。这种约束在现实世界的过程建模中自然出现,如通信网络中的数据包路由和疾病的感染传播途径,其中恢复赋予持久的抵抗力。虽然没有等待时间限制的时间路径是已知的是可行的多项式时间,我们表明,这个问题的“不安分的变种”变得计算困难,即使在非常严格的设置。例如,当以到底层图的不相交路径的距离为参数时,它是W[1]-硬的,这意味着对于许多其他参数,如反馈顶点数和路径宽度,它是W [1]-硬的。因此,一个自然的问题是,这个问题在某些自然环境中是否变得容易处理。我们探索了几种自然的参数化,提出了三种参数的FPT算法:(1)输出相关参数(这里是路径的最大长度),(2)应用于底层图的经典参数(例如,反馈边数),以及(3)称为定时反馈顶点数的新参数,其捕获输入时间图的更细粒度的时间特征,并且其可能是本工作之外的感兴趣的。
英文摘要:
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs where the vertex set is fixed but the edge set changes over time, gained more and more attention. A path is time-respecting, or temporal, if it uses edges with non-decreasing time stamps. We investigate a basic constraint for temporal paths, where the time spent at each vertex must not exceed a given duration $Δ$, referred to as $Δ$-restless temporal paths. This constraint arises naturally in the modeling of real-world processes like packet routing in communication networks and infection transmission routes of diseases where recovery confers lasting resistance. While finding temporal paths without waiting time restrictions is known to be doable in polynomial time, we show that the "restless variant" of this problem becomes computationally hard even in very restrictive settings. For example, it is W[1]-hard when parameterized by the distance to disjoint path of the underlying graph, which implies W[1]-hardness for many other parameters like feedback vertex number and pathwidth. A natural question is thus whether the problem becomes tractable in some natural settings. We explore several natural parameterizations, presenting FPT algorithms for three kinds of parameters: (1) output-related parameters (here, the maximum length of the path), (2) classical parameters applied to the underlying graph (e.g., feedback edge number), and (3) a new parameter called timed feedback vertex number, which captures finer-grained temporal features of the input temporal graph, and which may be of interest beyond this work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。