Randomly coloring sparse random graphs with fewer colors than the maximum degree (Q3419603): Difference between revisions
From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/rsa/DyerFFV06, #quickstatements; #temporary_batch_1731505720702 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/rsa.20129 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/RSA.20129 / rank | |||
Normal rank | |||
Latest revision as of 06:12, 21 December 2024
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
