A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation |
scientific article |
Statements
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (English)
0 references
28 October 2011
0 references
unit disk graphs
0 references
unit coin graphs
0 references
penny graphs
0 references
independent set
0 references
clique partition
0 references
approximation algorithms
0 references
