Solving vertex coloring problems as maximum weight stable set problems (Q516805): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2016.09.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2016.09.018 / rank | |||
Normal rank | |||
Revision as of 03:19, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving vertex coloring problems as maximum weight stable set problems |
scientific article |
Statements
Solving vertex coloring problems as maximum weight stable set problems (English)
0 references
15 March 2017
0 references
vertex coloring
0 references
stable set
0 references
mixed integer linear programming
0 references
computational experiments
0 references
0 references
0 references
