中国科学院理论物理研究所机构知识库
Advanced  
ITP OpenIR  > 理论物理所2014年知识产出  > 期刊论文
题名: Solving the undirected feedback vertex set problem by local search
作者: Qin, SM ;  Zhou, HJ
刊名: EUROPEAN PHYSICAL JOURNAL B
出版日期: 2014
卷号: 87, 期号:11, 页码:273
关键词: GRAPHS
学科分类: Physics
DOI: 10.1140/epjb/e2014-50289-7
通讯作者: Qin, SM (reprint author), Chinese Acad Sci, Inst Theoret Phys, State Key Lab Theoret Phys, Beijing 100190, Peoples R China.
部门归属: [Qin, Shao-Meng
英文摘要: 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.
资助者: National Basic Research Program of China [2013CB932804]; Chinese Academy of Sciences [KJCX2-EW-J02]; National Science Foundation of China [11121403, 11225526]
收录类别: SCI
原文出处: 查看原文
语种: 英语
WOS记录号: WOS:000354372000003
Citation statistics: 
内容类型: 期刊论文
URI标识: http://ir.itp.ac.cn/handle/311006/15568
Appears in Collections:理论物理所2014年知识产出 _期刊论文

Files in This Item: Download All
File Name/ File Size Content Type Version Access License
Solving the undirected feedback vertex set problem by local search.pdf(360KB)----开放获取View Download

Recommended Citation:
Qin, SM,Zhou, HJ. Solving the undirected feedback vertex set problem by local search[J]. EUROPEAN PHYSICAL JOURNAL B,2014,87(11):273.
Service
 Recommend this item
 Sava as my favorate item
 Show this item's statistics
 Export Endnote File
Google Scholar
 Similar articles in Google Scholar
 [Qin, SM]'s Articles
 [Zhou, HJ]'s Articles
CSDL cross search
 Similar articles in CSDL Cross Search
 [Qin, SM]‘s Articles
 [Zhou, HJ]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
  Add to CiteULike  Add to Connotea  Add to Del.icio.us  Add to Digg  Add to Reddit 
文件名: Solving the undirected feedback vertex set problem by local search.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院理论物理研究所 - Feedback
Powered by CSpace