2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Adrian Dumitrescu, János Pach
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 correspondin…