A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph (Q4847401): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5782525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decay of correlations in classical lattice models at high temperature / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4856750 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank | |||
Normal rank | |||
Latest revision as of 16:23, 23 May 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
