763 followers
Abstract The objective of the Maximum Clique Problem (MCP) is to find the largest complete subgraph in a given graph. The problem is known as NP-hard and we have developed a heuristic algorithm based on a Scatter... https://t.co/2DOqSJxThY