A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph (Q4847401)
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: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph |
scientific article; zbMATH DE number 798939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph |
scientific article; zbMATH DE number 798939 |
Statements
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph (English)
0 references
14 March 1996
0 references
problem of coloring of a graph
0 references
randomized algorithms
0 references
stationary distribution
0 references
0.8624453544616699
0 references
0.8380109667778015
0 references
0.8301503658294678
0 references
0.8189941048622131
0 references
