arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2605.15833cs.DScs.DMmath.CO
收藏

$k$-边缺陷时间图的线性时间探索研究

Exploration of $k$-edge-deficient temporal graphs in linear time

Moscow Institute of Physics and Technology (MIPT)(莫斯科物理技术学院);School of Computer Science and Informatics, University of Liverpool(利物浦大学计算机科学与信息学院)

Ivan Lahtin, Viktor Zamaraev

AI总结:

本文研究了时间图的探索问题,提出了一种线性时间内探索始终连通的$k$-边缺陷时间图的方法,解决了静态图线性时间探索的复杂性问题。

摘要:

我们研究了探索问题,其中代理必须在时间图中访问所有顶点,同时每时间步只能遍历一条可用边。与静态图不同,时间约束可能显著增加探索时间,即使每个快照都连通。为了更好地理解这种复杂性来源,我们考虑始终连通的$k$-边缺陷时间图,每个快照都连通且与固定基础$n$-顶点图最多差$k$条边。尽管这些图在结构上接近静态图,但它们仍可能表现出非平凡的时间行为。先前工作表明这些图可以在$O(kn \log n)$时间步内探索,并建立了$Ω(n \log k)$的下界,留下是否可能在$n$时间内线性时间探索的问题。我们通过证明任何始终连通的$k$-边缺陷时间图都允许长度为$O(nk \log k)$的探索计划来解决这个问题。此外,给定这样的时间图,相应的探索计划可以在多项式时间内计算。获得的界限是顶点数的线性函数,至多取决于$k$,去除了对$n$的额外对数依赖,并且几乎是最优的。特别是,对于常数$k$,我们的结果给出了$Θ(n)$的探索时间,表明在近静态的范围内,时间探索本质上保留了静态图遍历的线性时间特性。

英文摘要:

We study the Temporal Exploration problem, where an agent must visit all vertices of a temporal graph while traversing at most one available edge per time step. Unlike static graphs, which can be explored in linear time, temporal constraints can substantially increase exploration time even when every snapshot of the graph is connected. To better understand the source of this complexity, we focus on a near-static setting and consider always-connected $k$-edge-deficient temporal graphs, in which each snapshot is connected and differs from a fixed underlying $n$-vertex graph by at most $k$ edges. Although such graphs are structurally close to static graphs, they can still exhibit non-trivial temporal behaviour. Prior work showed that these graphs can be explored in $O(kn \log n)$ time steps and established a lower bound of $Ω(n \log k)$, leaving open whether linear-time exploration in $n$ is possible. We resolve this question by showing that any always-connected $k$-edge-deficient temporal graph admits an exploration schedule of length $O(nk \log k)$. Moreover, given such a temporal graph, the corresponding exploration schedule can be computed in polynomial time. The obtained bound is linear in the number of vertices up to a factor depending only on $k$, removes the extraneous logarithmic dependence on $n$, and is nearly optimal. In particular, for constant $k$, our result yields an order-optimal $Θ(n)$ exploration time, showing that temporal exploration in this near-static regime essentially retains the linear-time character of static graph traversal.

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

↑