Graph \(k\)-colorability using a threshold accepting and Davis-Putnam hybrid algorithm (Q3556771)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph k-colorability using a threshold accepting and Davis-Putnam hybrid algorithm |
scientific article; zbMATH DE number 5701686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph \(k\)-colorability using a threshold accepting and Davis-Putnam hybrid algorithm |
scientific article; zbMATH DE number 5701686 |
Statements
26 April 2010
0 references
graph coloring
0 references
simulated annealing
0 references
Davis \& Putnam
0 references
threshold accepting
0 references
chromatic number
0 references
combinatorial optimization
0 references
0.7848231196403503
0 references
0.7578401565551758
0 references
0.748153567314148
0 references
0.7455552220344543
0 references
0.7394140362739563
0 references
