arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.0446cs.AIcond-mat.dis-nn
收藏

用局部搜索法求解无向反馈点集问题

Solving the undirected feedback vertex set problem by local search

Institute of Theoretical Physics, Chinese Academy of Sciences(中国科学院理论物理研究所)

Shao-Meng Qin, Hai-Jun Zhou

摘要:

无向图由一组顶点和顶点之间的一组无向边组成。这样的图可能包含大量的圈,则反馈顶点集(FVS)是与这些圈中的每个圈相交的顶点的集合。构造一个基数接近全局最小值的FVS是一个非确定性多项式完备复杂性类的优化问题,因此对于一些大型图的实例可能非常困难。本文提出了一种求解无向FVS问题的模拟退火局部搜索算法。通过定义一个顺序的顶点外的FVS,我们取代了全局循环约束的一组局部顶点约束这个顺序。在这些局部约束条件下,通过模拟退火动态过程逐渐减小焦点FVS的基数。在Erödos-Renyi随机图和正则随机图上对该算法进行了测试,发现该算法在性能上与信念传播引导抽取算法相当.

英文摘要:

An undirected graph consists of a set of vertices and a set of undirected edges between vertices. Such a graph may contain an abundant number of cycles, then a feedback vertex set (FVS) is a set of vertices intersecting with each of these cycles. Constructing a FVS of cardinality approaching the global minimum value is a optimization problem in the nondeterministic polynomial-complete complexity class, therefore it might be extremely difficult for some large graph instances. In this paper we develop a simulated annealing local search algorithm for the undirected FVS problem. By defining an order for the vertices outside the FVS, we replace the global cycle constraints by a set of local vertex constraints on this order. Under these local constraints the cardinality of the focal FVS is then gradually reduced by the simulated annealing dynamical process. We test this heuristic algorithm on large instances of Erödos-Renyi random graph and regular random graph, and find that this algorithm is comparable in performance to the belief propagation-guided decimation algorithm.

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

↑