Login / Signup
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.
Imran A. Pirwani
Mohammad R. Salavatipour
Published in:
Algorithmica (2012)
Keyphrases
</>
approximation algorithms
computationally efficient
graph theoretic
maximum clique
pairwise
graphical models
graph matching
graph theory
weighted graph
minimum cost
spanning tree
independent set