计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (7): 70-71.DOI: 10.3778/j.issn.1002-8331.2009.07.022

• 研究、探讨 • 上一篇    下一篇

求解Ramsey数下界的模拟退火算法

邵泽辉1,王子成1,肖建华2   

  1. 1.华中科技大学 控制科学与工程系,武汉 430074
    2.南开大学 现代物流研究中心,天津 300071
  • 收稿日期:2008-12-02 修回日期:2009-01-19 出版日期:2009-03-01 发布日期:2009-03-01
  • 通讯作者: 邵泽辉

Lower bounds for Ramsey numbers based on simulated annealing algorithm

SHAO Ze-hui1,WANG Zi-cheng1,XIAO Jian-hua2   

  1. 1.Department of Control Science and Engineering,Huazhong University of Science and Technology,Wuhan 430074,China
    2.Research Center of Logistics,Nankai University,Tianjin 300071,China
  • Received:2008-12-02 Revised:2009-01-19 Online:2009-03-01 Published:2009-03-01
  • Contact: SHAO Ze-hui

摘要: 对于图G1G2,2色广义Ramsey数RG1G2)是指最小正整数p,使得每一个p阶的图G,或者G包含G1,或者G的补图包含G2。用改进的模拟退火算法求解得到了RWmKn),RBmKn),RFmKn),类型的一些Ramsey数的下界。

关键词: Ramsey数, 模拟退火, 边着色, 循环图

Abstract: For given graphs G1G2,the 2-color Ramsey number RG1G2) is defined to be the least positive integer p such that every 2-coloring of the edges of complete graph Kp contains a monochromatic copy of Gi colored with i,for 1≤i≤2.With the help of simulated annealing algorithm,some lower bounds of Ramsey numbers for the families RWmKn),RBmKn),RFmKn) is obtained.

Key words: Ramsey number, simulated annealing, edge coloring, cyclic graph