A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
type: Item
instance of: scholarly article
title: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
zbMATH Open document ID: 0833.60070
publication date: 1996-03-14T00:00:00Z
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 798939
zbMATH Keywords: problem of coloring of a graph
zbMATH Keywords: randomized algorithms
zbMATH Keywords: stationary distribution
author: Mark Jerrum
MaRDI profile type: Publication
full work available at URL: rsa.3240070205
OpenAlex ID: W2109260999
cites work: Q5782525
cites work: Some simplified NP-complete graph problems
cites work: Decay of correlations in classical lattice models at high temperature
cites work: Q4856750
cites work: Random generation of combinatorial structures from a uniform distribution
DOI: 10.1002/RSA.3240070205
published in: Random Structures \& Algorithms
description: scientific article; zbMATH DE number 798939