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

平面图中的Token Jumping具有线性规模的核

Token Jumping in Planar Graphs has Linear Sized Kernels

Daniel W. Cranston

AI总结:

针对平面图上规模为k的独立集间的令牌跳跃可达性问题,证明其存在规模线性于k的核,将原问题转换为O(k)阶平面图上的等价问题,强化了固定参数下运行时间的上界。

摘要:

设G为一个平面图,I_s和I_t是G中的两个独立集,规模均为k。我们在I_s的每个顶点上放置一个“令牌”,目标是通过重复的“令牌跳跃”操作将所有令牌移动到I_t,该操作是指从一个顶点移除单个令牌并将其放置到另一个顶点上。我们要求每一步中间的令牌排列都对应一个规模为k的独立集。给定G、I_s和I_t,我们探究是否存在一个令牌跳跃序列能将I_s转换为I_t。当k作为输入的一部分时,已知该问题是PSPACE完全的。不过,Ito、Kamiński和Ono已证明该问题是固定参数可处理的,也就是说,当k固定时,该问题可以在G的阶数的多项式时间内求解。本文通过证明该问题存在规模关于k线性的核,强化了运行时间关于k的上界。更准确地说,我们将平面图上的任意输入问题转换为阶数为O(k)的(平面)图上的等价问题。

英文摘要:

Let $G$ be a planar graph and $I_s$ and $I_t$ be two independent sets in $G$, each of size $k$. We begin with a "token" on each vertex of $I_s$ and seek to move all tokens to $I_t$, by repeated "token jumping", removing a single token from one vertex and placing it on another vertex. We require that each intermediate arrangement of tokens again specifies an independent set of size $k$. Given $G$, $I_s$, and $I_t$, we ask whether there exists a sequence of token jumps that transforms $I_s$ to $I_t$. When $k$ is part of the input, this problem is known to be PSPACE-complete. However, it was shown by Ito, Kamiński, and Ono to be fixed-parameter tractable. That is, when $k$ is fixed, the problem can be solved in time polynomial in the order of $G$. Here we strengthen the upper bound on the running time in terms of $k$ by showing that the problem has a kernel of size linear in $k$. More precisely, we transform an arbitrary input problem on a planar graph into an equivalent problem on a (planar) graph with order $O(k)$.

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

↑