Research on using heuristic algorithms to solve MCP
Ling Chen · Jisuanji gongcheng yu sheji · 2007
The maximum clique problem (MCP) is a classical problem of combinatorial optimization in graph theory, and is a kind of NP-Complete problem. MCP has been widely researched internationally, however, in china the research of it is just beginning. The definition of MCP is described; the development about using heuristic algorithms to solve MCP is expounded; a variety of typically heu- ristic algorithms solving MCP are analyzed and researched, including introducing about these algorithms, their basic ideas and charac- teristics and performances about solving MCP. Finally the test benchmark graphs for testing the performance of these algorithms are de- scribed.