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

时序图中的解析集

Resolving Sets in Temporal Graphs

Jan Bok, Antoine Dailly, Tuomo Lehtilä

AI总结:

本文将解析集推广到时序图,定义时序解析集,证明最小时序解析集问题在多类受限时序图上 NP 完全,并为路径、星图及周期时序图给出多项式算法。

摘要:

图 $G$ 中的解析集 $R$ 是一个顶点集,使得 $G$ 的每个顶点都能通过其到 $R$ 中各顶点的距离被唯一识别。该概念于 20 世纪 70 年代提出,此后从组合与算法两个角度得到了广泛研究。我们提出将解析集概念推广到时序图,即边集随离散时间步变化的图。在此设定中,从 $u$ 到 $v$ 的时序距离是指从 $u$ 出发、沿边上时间戳严格递增的旅程到达 $v$ 的最早可能时间步,也就是 $v$ 能够接收到从 $u$ 广播的消息的首个时间步。时序图 $\mathcal{G}$ 的时序解析集是其顶点的一个子集 $R$,使得 $\mathcal{G}$ 的每个顶点都能通过其与 $R$ 中顶点之间的时序距离被唯一识别。我们研究寻找最小规模时序解析集的问题,并证明即使在非常受限的图类以及对时间步有强约束的情况下,该问题仍是 NP 完全的:这些情况包括每条边只出现在时间步 1 或 2 的时序完全图、每条边至多出现在两个连续时间步的时序树,甚至包括每条边至多出现在两个(不必连续的)时间步的时序细分星图。另一方面,我们针对每条边恰好出现在一个时间步的时序路径和时序星图给出了多项式时间算法,并对若干边按周期性时间步出现的时序图类给出了组合分析和算法。

英文摘要:

A \emph{resolving set} $R$ in a graph $G$ is a set of vertices such that every vertex of $G$ is uniquely identified by its distances to the vertices of $R$. Introduced in the 1970s, this concept has been since then extensively studied from both combinatorial and algorithmic points of view. We propose a generalization of the concept of resolving sets to temporal graphs, \emph{i.e.}, graphs with edge sets that change over discrete time-steps. In this setting, the \emph{temporal distance from $u$ to $v$} is the earliest possible time-step at which a journey with strictly increasing time-steps on edges leaving $u$ reaches $v$, \emph{i.e.}, the first time-step at which $v$ could receive a message broadcast from $u$. A \emph{temporal resolving set} of a temporal graph $\mathcal{G}$ is a subset $R$ of its vertices such that every vertex of $\mathcal{G}$ is uniquely identified by its temporal distances from vertices of $R$. We study the problem of finding a minimum-size temporal resolving set, and show that it is NP-complete even on very restricted graph classes and with strong constraints on the time-steps: temporal complete graphs where every edge appears in either time-step~1 or~2, temporal trees where every edge appears in at most two consecutive time-steps, and even temporal subdivided stars where every edge appears in at most two (not necessarily consecutive) time-steps. On the other hand, we give polynomial-time algorithms for temporal paths and temporal stars where every edge appears in exactly one time-step, and give a combinatorial analysis and algorithms for several temporal graph classes where the edges appear in periodic time-steps.

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

↑