Solving the undirected feedback vertex set problem by local search | |
Zhou, HJ![]() | |
刊名 | EUROPEAN PHYSICAL JOURNAL B
![]() |
2014 | |
卷号 | 87期号:11页码:273 |
关键词 | GRAPHS |
ISSN号 | 1434-6028 |
通讯作者 | Qin, SM (reprint author), Chinese Acad Sci, Inst Theoret Phys, State Key Lab Theoret Phys, Beijing 100190, Peoples R China. |
英文摘要 | 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, in which case 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 an optimization problem in the nondeterministic polynomial-complete complexity class, and 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 adapting the heuristic procedure of Galinier et al. [P. Galinier, E. Lemamou, M.W. Bouzidi, J. Heuristics 19, 797 (2013)], which worked for the directed 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 Erdos-Renyi random graph and regular random graph, and find that this algorithm is comparable in performance to the belief propagation-guided decimation algorithm. |
学科主题 | Physics |
收录类别 | SCI |
资助信息 | National Basic Research Program of China [2013CB932804]; Chinese Academy of Sciences [KJCX2-EW-J02]; National Science Foundation of China [11121403, 11225526] |
原文出处 | http://dx.doi.org/10.1140/epjb/e2014-50289-7 |
语种 | 英语 |
WOS记录号 | WOS:000354372000003 |
公开日期 | 2015-06-03 |
内容类型 | 期刊论文 |
源URL | [http://ir.itp.ac.cn/handle/311006/15568] ![]() |
专题 | 理论物理研究所_理论物理所1978-2010年知识产出 |
推荐引用方式 GB/T 7714 | Zhou, HJ. Solving the undirected feedback vertex set problem by local search[J]. EUROPEAN PHYSICAL JOURNAL B,2014,87(11):273. |
APA | Zhou, HJ.(2014).Solving the undirected feedback vertex set problem by local search.EUROPEAN PHYSICAL JOURNAL B,87(11),273. |
MLA | Zhou, HJ."Solving the undirected feedback vertex set problem by local search".EUROPEAN PHYSICAL JOURNAL B 87.11(2014):273. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论