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

改进的时间图探索

Improved exploration of temporal graphs

Delft Institute of Applied Mathematics, TU Delft(代尔夫特应用数学研究所,代尔夫特理工大学);Université Côte d’Azur, CNRS, Inria, I3S(蔚蓝海岸大学,法国国家科学研究中心,法国数字与信息技术研究学院,I3S);Department of Computer Science, University of Oxford(牛津大学计算机系);Mathematical Institute, University of Oxford(牛津大学数学研究所)

Paul Bastide, Carla Groenland, Lukas Michel, Clément Rambaud, Paulina Smolarova

AI总结:

本文提出了一种改进的时间图探索算法,通过平均时间最大度的概念,给出了亚二次时间步数的上界,适用于连通图和具有有界平均度的图。

摘要:

时间图G是一个图序列(G_t)_{t∈I},其顶点集大小为n。时间探索问题要求找到一个最短的顶点序列,从给定的顶点出发,访问所有顶点,并在每个时间步t中要么留在当前顶点,要么移动到G_t中的相邻顶点。关于最短时间探索长度的界已被广泛研究。最基础的情况是当每个图G_t连通且最大度数有界时。在该设定下,Erlebach、Kammer、Luo、Sajenko和Spooner[ICALP 2019]证明存在一个探索G的序列,其时间步数为O(n^{7/4})。我们通过证明O(n^{3/2}√log n)时间步数足够来显著改进这一界。实际上,我们从一个更一般的陈述推导出这一结果。令G的平均时间最大度D为所有顶点v∈V(G)的max_{t∈I}d_{G_t}(v)的平均值,其中d_{G_t}(v)表示v在G_t中的度数。如果每个图G_t连通,我们证明存在一个探索G的序列,其时间步数为O(n^{3/2}√(D log n))。特别是,这给出了当底层图具有有界平均度时的第一个亚二次上界。作为特殊情况,这还改进了当底层图是平面图或具有有界树宽时的先前最佳界,并为所有这些设置提供了统一的方法。我们的界在D=o(n/log n)时已经是亚二次的。

英文摘要:

A temporal graph $G$ is a sequence $(G_t)_{t \in I}$ of graphs on the same vertex set of size $n$. The \emph{temporal exploration problem} asks for the length of the shortest sequence of vertices that starts at a given vertex, visits every vertex, and at each time step $t$ either stays at the current vertex or moves to an adjacent vertex in $G_t$. When each $G_t$ is connected and has bounded maximum degree, Erlebach, Kammer, Luo, Sajenko, and Spooner [ICALP 2019] showed that an exploration exists in $\mathcal{O}(n^{7/4})$ time steps. We significantly improve this bound by showing that $\mathcal{O}(n^{3/2}\sqrt{\log n})$ time steps suffice. In fact, we prove a more general statement unifying this setting with many others. Let the \emph{average temporal maximum degree} $D$ of $G$ be the average of $\max_{t \in I}d_{G_t}(v)$ over all vertices $v \in V(G)$, where $d_{G_t}(v)$ denotes the degree of $v$ in $G_t$. We show that if each $G_t$ is connected, then an exploration exists in $\mathcal{O}(n^{3/2}\sqrt{D\log n})$ time steps. This gives the first subquadratic upper bound when the underlying graph has bounded average degree, improving the previous best bounds when it is planar or has bounded treewidth. Our bound is subquadratic already when $D=o(n/\log n)$. In addition, we make progress on a recent conjecture of Baguley, Göbel, Klodt, Skretas, Sylvester, and Zamaraev [SODA 2025]. They conjectured that if $μ$ is a probability distribution on trees with maximum degree at most $Δ$ and each $G_t$ is sampled independently from $μ$, then an exploration exists in $\mathcal{O}(\sqrtΔn)$ time steps with high probability. We show that there is a temporal exploration of length $\mathcal{O}(Δn\log^3 n)$ with high probability. This improves the previous best bound of $\mathcal{O}(n^{3/2})$ and extends to the more general setup of average temporal maximum degree.

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

↑