Solving vertex coloring problems as maximum weight stable set problems (Q516805): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6695023 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex coloring | |||
| Property / zbMATH Keywords: vertex coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
stable set | |||
| Property / zbMATH Keywords: stable set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
mixed integer linear programming | |||
| Property / zbMATH Keywords: mixed integer linear programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational experiments | |||
| Property / zbMATH Keywords: computational experiments / rank | |||
Normal rank | |||
Revision as of 04:20, 1 July 2023
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
