Message passing for vertex covers
Weigt, Martin; Zhou, Haijun; Weigt, M , Inst Sci Interchange, Viale Settimio Severo 65, I-10133 Turin, Italy
刊名PHYSICAL REVIEW E
2006
卷号74期号:4页码:-
关键词Random Graphs Satisfiability Problems Cavity Method Frustration Algorithms Transition Dynamics Number Phase Model
ISSN号1539-3755
英文摘要Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze message-passing techniques, namely, warning and survey propagation, which serve as efficient heuristic algorithms for solving these computational hard problems. We show also, how previously obtained results on the typical-case behavior of vertex covers of random graphs can be recovered starting from the message-passing equations, and how they can be extended.
学科主题Physics
URL标识查看原文
WOS记录号WOS:000241723000019
公开日期2012-08-02
内容类型期刊论文
源URL[http://ir.itp.ac.cn/handle/311006/5893]  
专题理论物理研究所_理论物理所1978-2010年知识产出
通讯作者Weigt, M , Inst Sci Interchange, Viale Settimio Severo 65, I-10133 Turin, Italy
推荐引用方式
GB/T 7714
Weigt, Martin,Zhou, Haijun,Weigt, M , Inst Sci Interchange, Viale Settimio Severo 65, I-10133 Turin, Italy. Message passing for vertex covers[J]. PHYSICAL REVIEW E,2006,74(4):-.
APA Weigt, Martin,Zhou, Haijun,&Weigt, M , Inst Sci Interchange, Viale Settimio Severo 65, I-10133 Turin, Italy.(2006).Message passing for vertex covers.PHYSICAL REVIEW E,74(4),-.
MLA Weigt, Martin,et al."Message passing for vertex covers".PHYSICAL REVIEW E 74.4(2006):-.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace