UMR CNRS 7253

Aziz Moukrim
Aziz Moukrim
Aziz Moukrim
Aziz Moukrim
Aziz Moukrim

Site Tools


en:mcp

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
en:mcp [2012/08/03 18:06]
dangducc
en:mcp [2012/08/10 04:00] (current)
dangducc
Line 20: Line 20:
 [2] D-C. Dang and A. Moukrim. Subgraph extraction and memetic algorithm for the maximum clique problem. IJCCI (ICEC) 2010, p77-84, 2010. \\ [2] D-C. Dang and A. Moukrim. Subgraph extraction and memetic algorithm for the maximum clique problem. IJCCI (ICEC) 2010, p77-84, 2010. \\
 [3] J. Xue. Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Network, 24:​109–120,​ 1994. \\ [3] J. Xue. Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Network, 24:​109–120,​ 1994. \\
-[4] D-C. Dang and A. Moukrim. Subgraph extraction and hybrid metaheuristics for the maximum clique problem. ​//Under revision//+[4] D-C. Dang and A. Moukrim. Subgraph extraction and hybrid metaheuristics for the maximum clique problem. ​Accepted for publication in Journal of Heuristics, 2012.

User Tools