Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

GC
2011
Springer

favoriteEmaildiscussreport

212views Applied Computing» more GC 2011»

Minimum Clique Partition in Unit Disk Graphs

12 years 7 months ago

Minimum Clique Partition in Unit Disk Graphs

Download www.cs.uwm.edu

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

Real-time Traffic

Applied Computing | GC 2011 | Minimum Clique Partition | Udg | Vertices |

claim paper

Related Content

» A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

» Clique coverings and partitions of line graphs

» ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...

» On the Approximability of Maximum and Minimum Edge Clique Partition Problems

» Matroid Representation of Clique Complexes

» A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs

» Minimum Latency Gossiping in Radio Networks

» Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

» Local Edge Colouring of YaoLike Subgraphs of Unit Disk Graphs

Post Info
More Details (n/a)

Added	28 Aug 2011
Updated	28 Aug 2011
Type	Journal
Year	2011
Where	GC
Authors	Adrian Dumitrescu, János Pach

Comments (0)