An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946)
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 7355329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs |
scientific article; zbMATH DE number 7355329 |
Statements
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (English)
0 references
4 June 2021
0 references
selective graph coloring
0 references
partition coloring
0 references
cutting plane algorithm
0 references
perfect graph generation
0 references
0 references
0.7737579941749573
0 references
0.7629095911979675
0 references
0.7599688172340393
0 references
0.7525733709335327
0 references
0.7475571036338806
0 references
