arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9903006cs.LO
收藏

为HCP设计SAT

Designing SAT for HCP

Anatoly D. Plotnikov

摘要:

对于任意无向图$G$,我们仅使用布尔代数的工具来设计HCP的满足性问题(SAT)。得到的SAT是Hamilton圈存在条件的逻辑公式,并使用$m$布尔变量,其中$m$是图的边数.这个布尔表达式是真的,当且仅当一个初始图是哈密尔顿的。也就是说,布尔变量的每个满意分配确定$G$的哈密尔顿循环,并且$G$的每个哈密尔顿循环对应于布尔变量的满意分配。在通常情况下,所获得的布尔表达式可以具有指数长度(布尔文字的数量)。

英文摘要:

For arbitrary undirected graph $G$, we are designing SATISFIABILITY problem (SAT) for HCP, using tools of Boolean algebra only. The obtained SAT be the logic formulation of conditions for Hamiltonian cycle existence, and use $m$ Boolean variables, where $m$ is the number of graph edges. This Boolean expression is true if and only if an initial graph is Hamiltonian. That is, each satisfying assignment of the Boolean variables determines a Hamiltonian cycle of $G$, and each Hamiltonian cycle of $G$ corresponds to a satisfying assignment of the Boolean variables. In common case, the obtained Boolean expression may has an exponential length (the number of Boolean literals).

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

↑