Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q58203651, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58203651 / rank | |||
Normal rank | |||
Revision as of 22:32, 27 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
