On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167)
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 6301570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the selective graph coloring problem in some special classes of graphs |
scientific article; zbMATH DE number 6301570 |
Statements
On the complexity of the selective graph coloring problem in some special classes of graphs (English)
0 references
6 June 2014
0 references
computational complexity
0 references
approximation algorithms
0 references
PTAS
0 references
scheduling
0 references
bipartite graphs
0 references
split graphs
0 references
complete \(q\)-partite graphs
0 references
clustering
0 references
0 references
0 references
0.9854942560195924
0 references
0.90965735912323
0 references
0.8679651021957397
0 references
0.8054782748222351
0 references
0.8008756041526794
0 references
