Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:25, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes |
scientific article |
Statements
Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (English)
0 references
4 October 2010
0 references
independent set
0 references
graph coloring
0 references
co-\(k\)-plex
0 references
\(k\)-dependent set
0 references
defective coloring
0 references
\(t\)-improper coloring
0 references
