GC
2011
Springer
13 years 7 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...