Minimum Clique Partition in Unit Disk Graphs

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 unit disk graph (UDG) has these points as vertices, and edges connecting points at distance

• Type: Journal
• Year: 2011
• Where: GC
• Authors: Adrian Dumitrescu, János Pach
• Keywords: Applied Computing, GC 2011, Minimum Clique Partition, Udg, Vertices