Zig-Zag Numberlink是NP完全的
Zig-Zag Numberlink is NP-Complete
摘要:
$m \times n$网格中的$t$端子对何时可以通过覆盖网格所有顶点的$t$顶点不相交路径连接?我们证明了这个问题是NP-完全的。我们的硬度结果可以与之前的两个NP-硬度证明进行比较:Lynch在1975年的证明中没有“覆盖所有顶点”的约束,以及Kotsuma和Takenaga在2010年的证明中,路径被限制为在其同伦类中具有最少的可能角。后一种限制是著名的Nikoli难题\emph{Numberlink}的常见形式;我们的问题是Numberlink的另一种常见形式,有时称为\emph{Zig-Zag Numberlink},并由智能手机应用程序\emph{Flow Free}推广。
英文摘要:
When can $t$ terminal pairs in an $m \times n$ grid be connected by $t$ vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness proofs: Lynch's 1975 proof without the ``cover all vertices'' constraint, and Kotsuma and Takenaga's 2010 proof when the paths are restricted to have the fewest possible corners within their homotopy class. The latter restriction is a common form of the famous Nikoli puzzle \emph{Numberlink}; our problem is another common form of Numberlink, sometimes called \emph{Zig-Zag Numberlink} and popularized by the smartphone app \emph{Flow Free}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。