1 paper · 1 filter
Michael Vella, John Abela, Kristian Guillaumier
The maximum clique problem (MCP) is a fundamental problem in graph theory and in computational complexity. Given a graph G, the problem is that of finding the largest clique (compl…