Minimum Coloring k-Colorable Graphs in Polynomial Average Time (Q4939608)
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 1400084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum Coloring k-Colorable Graphs in Polynomial Average Time |
scientific article; zbMATH DE number 1400084 |
Statements
Minimum Coloring k-Colorable Graphs in Polynomial Average Time (English)
0 references
20 March 2000
0 references
chromatic number
0 references
polynomial algorithms
0 references
random graphs
0 references
coloring
0 references
0.9011371731758118
0 references
0.8924302458763123
0 references
0.8706485629081726
0 references
0.8689903616905212
0 references
0.8674418926239014
0 references
