Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5795203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes |
scientific article; zbMATH DE number 5795203 |
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
0 references
0.8057328462600708
0 references
0.8026341199874878
0 references
0.7898719906806946
0 references
0.7802026867866516
0 references
