27 search results - page 3 / 6 » Minimum Clique Partition in Unit Disk Graphs |
120
click to vote
OL
2011
14 years 4 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
TCS
2010
14 years 7 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
114
click to vote
SODA
2012
ACM
12 years 12 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
JGAA
2000
14 years 9 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
107
click to vote
IMCSIT
2010
14 years 7 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...