A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph (Q4847401): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.3240070205 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109260999 / rank | |||
Normal rank | |||
Revision as of 18:21, 19 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
