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

平面图上记号跳跃的固定参数可处理性

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

Takehiro Ito, Marcin Kamiński, Hirotaka Ono

摘要:

假设给定一个图的两个独立集合$I_0$和$I_r$,使得$|I_0| = |I_r|$,并想象在$I_0$的每个顶点上放置一个标记。标记跳跃问题是确定是否存在一个将$I_0$转换为$I_r$的独立集序列,使得序列中的每个独立集通过将一个标记精确地移动到另一个顶点而从前一个独立集产生。这个问题即使对于最大度为3的平面图也是PSPACE-完全的,而对于一般的图,当用标记数参数化时,这个问题是W[1]-困难的。在本文中,我们提出了一个固定参数的平面图上的令牌跳跃问题的算法,其中的参数只是令牌的数量。此外,该算法可以修改,以便它为yes实例找到最短序列。同样的算法可以应用到更广泛的一类图,$K_{3,t}$ -free图的任何固定整数$t \ge 3$,它产生固定参数的算法。

英文摘要:

Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms $I_0$ into $I_r$ so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This problem is known to be PSPACE-complete even for planar graphs of maximum degree three, and W[1]-hard for general graphs when parameterized by the number of tokens. In this paper, we present a fixed-parameter algorithm for the token jumping problem on planar graphs, where the parameter is only the number of tokens. Furthermore, the algorithm can be modified so that it finds a shortest sequence for a yes-instance. The same scheme of the algorithms can be applied to a wider class of graphs, $K_{3,t}$-free graphs for any fixed integer $t \ge 3$, and it yields fixed-parameter algorithms.

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

↑