On the tractability of coloring semirandom graphs (Q975431)
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 5719171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the tractability of coloring semirandom graphs |
scientific article; zbMATH DE number 5719171 |
Statements
On the tractability of coloring semirandom graphs (English)
0 references
9 June 2010
0 references
graph algorithms
0 references
average case analysis
0 references
semi-random models
0 references
\(k\)-coloring
0 references
0.8562859892845154
0 references
0.8279802203178406
0 references
0.8251391053199768
0 references
0.8230457305908203
0 references
0.8218588829040527
0 references
