Tayachi, Dalila; Khemiri, Marwa - In: International Journal of Operations Research and … 9 (2018) 4, pp. 21-35
This article tackles the maximum clique problem MCP known as an NP-hard graph problem. The maximum clique problem consists in finding in an undirected graph a complete sub-graph (clique) of maximum cardinality. As the MCP is a classical graph problem extensively studied, the main contribution of...