A short proof of the NP-completeness of minimum sum interval coloring (Q2488233)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of the NP-completeness of minimum sum interval coloring |
scientific article |
Statements
A short proof of the NP-completeness of minimum sum interval coloring (English)
0 references
25 August 2005
0 references
Computational complexity
0 references
Graph coloring
0 references
Minimum sum coloring
0 references
Chromatic sum
0 references
Interval graph
0 references
0 references
