On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.018 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2124125948 / rank | |||
Normal rank |
Revision as of 23:50, 19 March 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