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

对始终S连接的时间图的探索

Exploration of Always $S$-Connected Temporal Graphs

Department of Computer Science, University of St Andrews(圣安德鲁斯大学);Department of Computer Science, University of Liverpool(利物浦大学)

Duncan Adamson, Paul G Spirakis

AI总结:

本文研究了始终S连接时间图的探索问题,提出了一种新的方法,能够高效地探索具有特定结构的时间图。

摘要:

时间图是静态图的泛化,由一系列快照定义,每个快照是一个在共同顶点集上定义的静态图。探索问题是时间图上最基础且研究最深入的问题之一,询问一组m个代理是否能访问图中的每个顶点,每个代理只能在每个快照中穿越一条边。在本文中,我们引入并研究了始终S连接的时间图,这是始终连接时间图的泛化,其中而不是在每个快照中形成一个单一的连通分量,我们最多有|S|个分量,每个分量由连接到集合S中的一个顶点定义。我们使用这种表述作为探索允许(r,b)-划分的图的工具,其中顶点集被划分为不连通的分量,每个分量是S连接的,其中|S|≤b。我们证明了一个始终S连接的时间图,其中m=|S|且平均度为Δ,可以由m个代理在O(n^{1.5} m^3 Δ^{1.5} log^{1.5}(n))个快照中被探索。利用这一子程序,我们证明任何具有树宽至多为k的始终连接时间图可以由一个代理在O(n^{4/3} k^{5.5} log^{2.5}(n))个快照中被探索,这在k较小的情况下优于当前最先进的方法。此外,我们还证明了仅包含少量大团的区间图可以由一个代理在O(n^{4/3} log^{2.5}(n))个快照中被探索。

英文摘要:

\emph{Temporal graphs} are a generalisation of (static) graphs, defined by a sequence of \emph{snapshots}, each a static graph defined over a common set of vertices. \emph{Exploration} problems are one of the most fundamental and most heavily studied problems on temporal graphs, asking if a set of $m$ agents can visit every vertex in the graph, with each agent only allowed to traverse a single edge per snapshot. In this paper, we introduce and study \emph{always $S$-connected} temporal graphs, a generalisation of always-connected temporal graphs where, rather than forming a single connected component in each snapshot, we have at most $\vert S \vert$ components, each defined by the connection to at least one vertex in the set $S$. We use the model of always $S$-connected temporal graphs to study \emph{subgraphs} of always-connected temporal graphs, with motivation coming from networks with a small number of ``choke-points'', such as rail networks, where all external traffic into a subnetwork comes from a limited number of external connections. We use this formulation as a tool for exploring always-connected temporal graphs admitting an \emph{$(r,b)$-division}, a partitioning of the vertex set into $r$ components, each of which is $S$-connected, where $\vert S \vert \leq b$. We show that an always $S$-connected temporal graph with $m = \vert S \vert$ and an average degree of $Δ$ can be explored by $m$ agents in $O(n^{3/2} m^2 Δ^{3/2}\log^{3/2}(n) + + nm^3)$ snapshots. Using this result as a subroutine, we show that any always-connected temporal graph with treewidth at most $k$ can be explored by a single agent in $O\left(n^{4/3} k^{9/2}\log^{5/2}(n)\right)$ snapshots, improving on the current state-of-the-art for small values of $k$.

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

↑