Sciweavers

Share
GC
2011
Springer

Minimum Clique Partition in Unit Disk Graphs

8 years 2 months ago
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
Adrian Dumitrescu, János Pach
Added 28 Aug 2011
Updated 28 Aug 2011
Type Journal
Year 2011
Where GC
Authors Adrian Dumitrescu, János Pach
Comments (0)
books