Login / Signup
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation.
Márcia R. Cerioli
Luérbio Faria
Talita O. Ferreira
Fábio Protti
Published in:
Electron. Notes Discret. Math. (2004)
Keyphrases
</>
maximum independent set
independent set
graph theory
graph theoretic
graph mining
graph model
graph matching
directed graph
approximation algorithms
graph partitioning
graph representation
error bounds
computational complexity
spanning tree
random graphs
maximum clique
graph properties
metaheuristic
worst case