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

图约束逻辑的参数化复杂性

Parameterized Complexity of Graph Constraint Logic

Tom C. van der Zanden

摘要:

图约束逻辑是由Hearn和Demaine引入的框架,它提供了几个问题,这些问题通常是简化的方便起点。我们研究了约束图可满足性的参数化复杂性和有界和无界版本的非确定性约束逻辑(NCL)的解决方案的长度,树宽和最大程度的基本约束图作为参数。作为一个主要的结果,我们表明,限制NCL保持PSPACE-完全图的有界带宽,加强赫恩和Demaine的框架。这使我们能够改善现有的结果,从NCL减少。我们证明了几个经典的图问题(包括独立集,反馈顶点集和支配集)的重构版本是PSPACE-完全的有界带宽的平面图和高峰时间,推广到$k\times n$板,是PSPACE-完全的,即使当$k$是最多一个常数。

英文摘要:

Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and maximum degree of the underlying constraint graph as parameters. As a main result we show that restricted NCL remains PSPACE-complete on graphs of bounded bandwidth, strengthening Hearn and Demaine's framework. This allows us to improve upon existing results obtained by reduction from NCL. We show that reconfiguration versions of several classical graph problems (including independent set, feedback vertex set and dominating set) are PSPACE-complete on planar graphs of bounded bandwidth and that Rush Hour, generalized to $k\times n$ boards, is PSPACE-complete even when $k$ is at most a constant.

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

↑