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

图对称破缺的BFS计数

BFS Enumeration for Breaking Symmetries in Graphs

Vyacheslav Moklev, Vladimir Ulyantsev

摘要:

有许多NP难的组合问题,涉及到寻找一个无向图满足一定的性质。解决此类问题的一种方法是将问题转换为布尔可满足性(SAT)或约束满足(CSP)问题的实例。这样的约简通常可以产生同一个图的许多同构表示。在这些条件下,减少搜索空间并加快搜索速度的一种方法是引入破密谓词。在本文中,我们介绍了三个新的和实际有效的破密谓词的无向连通图搜索的基础上广度优先搜索(BFS)枚举和比较与现有的破密方法在几个图的问题。

英文摘要:

There are numerous NP-hard combinatorial problems which involve searching for an undirected graph satisfying a certain property. One way to solve such problems is to translate a problem into an instance of the boolean satisfiability (SAT) or constraint satisfaction (CSP) problem. Such reduction usually can give rise to numerous isomorphic representations of the same graph. One way to reduce the search space and speed up the search under these conditions is to introduce symmetrybreaking predicates. In this paper we introduce three novel and practically effective symmetry-breaking predicates for an undirected connected graph search based on breadth-first search (BFS) enumeration and compare with existing symmetry-breaking methods on several graph problems.

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

↑