Login / Signup
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.
Márcia R. Cerioli
Luérbio Faria
Talita O. Ferreira
Fábio Protti
Published in:
RAIRO Theor. Informatics Appl. (2011)
Keyphrases
</>
maximum clique
graph matching
directed graph
approximation error
graph theory
graph properties
graph mining
spanning tree
graph representation
graph clustering
adjacency matrix
polynomial time complexity
maximal cliques
complex structures
graph model
weighted graph
graph structure