48 citations · 165 across the 65 of their papers we have counts for
1 paper · 2 filters
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…