当前位置:
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
An FPT algorithm for orthogonal buttons and scissors
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-07-02 , DOI: 10.1016/j.ipl.2020.105997 Dekel Tsur
中文翻译:
正交按钮和剪刀的FPT算法
更新日期:2020-07-02
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-07-02 , DOI: 10.1016/j.ipl.2020.105997 Dekel Tsur
We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an grid by a series of horizontal and vertical cuts. We show that the corresponding decision problem has an algorithm with time complexity , where k is an upper bound on the number of cuts.
中文翻译:
正交按钮和剪刀的FPT算法
我们研究了益智游戏“按钮和剪刀”,其目标是从 网格由一系列水平和垂直切割组成。我们证明了相应的决策问题具有时间复杂度的算法,其中k是切割次数的上限。