%0 Journal Article
%T Research Development of MCP and Benchmark Graphs<br>最大团问题研究进展及算法测试标准*
%A WANG Li-ai
%A ZHOU Xu-dong
%A CHEN Ling
%A <br>王丽爱
%A 周旭东
%A 陈崚
%J 计算机应用研究
%D 2007
%I 
%X The definition of MCP was described, and the development about using heuristic algorithms to solve MCP was analyzed and researched. Several typical heuristic algorithms about solving MCP were introduced. Finally the test benchmark graphs for testing the performance of these algorithms were described.
%K maximum clique problem(MCP)
%K heuristic algorithm
%K combinatorial optimization<br>最大团问题
%K 启发式算法
%K 组合优化
%K 最大团问题
%K 研究进展
%K 算法性能
%K 测试标准
%K Graphs
%K Benchmark
%K Development
%K 基准图
%K 启发式算法
%K 求解
%K 使用
%K 分析
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F61B5960FF2C7A42FB&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=DF92D298D3FF1E6E&sid=CB423C9A71560A74&eid=09ABD5535D9B6D45&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=2&reference_num=10