A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph (Q4847401): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 17:40, 5 March 2024
scientific article; zbMATH DE number 798939
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
