在桌子周围追逐时间表
A Timecop's Chase Around the Table
摘要:
我们考虑时变图(TVG)上由一名警察和一名强盗组成的警察与强盗博弈变体。所考虑的TVG是边周期图,即,对于每个边缘,二进制串$s_e$确定该边缘出现在哪个时间步长中,即当且仅当该串$s_e$在位置$t \mod |s_e|$处包含$1$时,边缘$e$出现在时间步长$t$中。这种周期性允许无限TVG的紧凑表示。我们证明,即使是非常简单的基础图,即,有向和无向循环问题是否存在一个cop-winning策略是NP-难和W [1]-难的参数化的顶点数。我们的第二个主要结果是匹配下界之间的比率的基本周期的长度和最小公倍数(LCM)的长度的二进制字符串描述的边缘周期图是强盗获胜。我们的第三个主要结果改进了以前已知的EXPTIME上界的一般边周期图的PSPACE成员的周期警察和强盗。
英文摘要:
We consider the cops and robber game variant consisting of one cop and one robber on time-varying graphs (TVG). The considered TVGs are edge periodic graphs, i.e., for each edge, a binary string $s_e$ determines in which time step the edge is present, namely the edge $e$ is present in time step $t$ if and only if the string $s_e$ contains a $1$ at position $t \mod |s_e|$. This periodicity allows for a compact representation of the infinite TVG. We proof that even for very simple underlying graphs, i.e., directed and undirected cycles the problem whether a cop-winning strategy exists is NP-hard and W[1]-hard parameterized by the number of vertices. Our second main result are matching lower bounds for the ratio between the length of the underlying cycle and the least common multiple (LCM) of the lengths of binary strings describing edge-periodicies over which the graph is robber-winning. Our third main result improves the previously known EXPTIME upper bound for Periodic Cop and Robber on general edge periodic graphs to PSPACE-membership.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。