On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:44, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the selective graph coloring problem in some special classes of graphs |
scientific article |
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
