Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jda/AdamaszekP16, #quickstatements; #temporary_batch_1732532539753 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jda/AdamaszekP16 / rank | |||
Normal rank | |||
Latest revision as of 12:02, 25 November 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
