Randomly coloring sparse random graphs with fewer colors than the maximum degree (Q3419603)
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: Randomly coloring sparse random graphs with fewer colors than the maximum degree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomly coloring sparse random graphs with fewer colors than the maximum degree |
scientific article |
Statements
Randomly coloring sparse random graphs with fewer colors than the maximum degree (English)
0 references
7 February 2007
0 references
Glauber dynamics
0 references
Monte Carlo algorithms
0 references
0 references
