Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721): 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.jda.2016.09.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2525416008 / rank | |||
Normal rank | |||
Revision as of 23:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and hardness results for the maximum edge \(q\)-coloring problem |
scientific article |
Statements
Approximation and hardness results for the maximum edge \(q\)-coloring problem (English)
0 references
9 December 2016
0 references
hardness of approximation
0 references
approximation algorithms
0 references
graph coloring
0 references
