Complexity of coloring random graphs: an experimental study of the hardest region (Q4577957)
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: Complexity of coloring random graphs: an experimental study of the hardest region |
scientific article; zbMATH DE number 6913944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of coloring random graphs: an experimental study of the hardest region |
scientific article; zbMATH DE number 6913944 |
Statements
Complexity of Coloring Random Graphs (English)
0 references
6 August 2018
0 references
graph coloring
0 references
average-case complexity
0 references
backtrack search
0 references
phase transition
0 references
random graphs
0 references
0 references
0 references
0.7921426892280579
0 references
0.7894665002822876
0 references
0.7723314762115479
0 references
0.7599765062332153
0 references
0.7596146464347839
0 references
