The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6012796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum \(k\)-colorable subgraph problem and orbitopes |
scientific article; zbMATH DE number 6012796 |
Statements
The maximum \(k\)-colorable subgraph problem and orbitopes (English)
0 references
7 March 2012
0 references
combinatorial optimization
0 references
integer programming
0 references
symmetry breaking
0 references
graph coloring
0 references
0 references
0.8551393151283264
0 references
0.8207891583442688
0 references
0.7770528793334961
0 references
0.772760808467865
0 references
