Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (26): 48-50.DOI: 10.3778/j.issn.1002-8331.2008.26.014

• 理论研究 • Previous Articles     Next Articles

New algorithm of maximal independent set and upper bound of independent number

LI Qin-feng1,LI You-feng2,DING Gen-hong3   

  1. 1.Department of Foundation Courses,Jinling Institute of Technology,Nanjing 210001,China
    2.School of Computer and Information Technology,Jinling Institute of Technology,Nanjing 210001,China
    3.College of Science,Hohai University,Nanjing 210098,China
  • Received:2007-11-06 Revised:2008-02-18 Online:2008-09-11 Published:2008-09-11
  • Contact: LI Qin-feng

一个新的极大独立集算法及独立数的界

李勤丰1,李尤丰2,丁根宏3   

  1. 1.金陵科技学院 基础部,南京 210001
    2.金陵科技学院 信息技术学院,南京 210001
    3.河海大学 理学院,南京 210098
  • 通讯作者: 李勤丰

Abstract: The maximum independent set problem is a classical problem in combinatorial optimization.It has been used widely.Firstly an upper bound is shown.Then by the analysis of the character of the maximum independent sets and the colligation of meta-heuristic algorithm,a new algorithm is given and its assurance is proved.After abundant experiments,the results show adequately that the algorithm presented in the thesis is efficacious.

Key words: maximal independent set, bound, greedy algorithm, graph theory

摘要: 最大独立集问题是图论中典型的组合优化问题,有着广泛的实际应用价值。分析了现有独立数的界公式后给出了新的上界公式,并通过分析贪婪算法和独立集自身的特征,给出了新的求解极大独立集的算法,并证明了其确定性。然后用实例验证了该算法的有效性。

关键词: 极大独立集, 界, 贪婪算法, 图论