Random sampling of colourings of sparse random graphs with a constant number of colours

Theoretical Computer Science, pp. 134-154, 2008.

Cited by: 10|Bibtex|Views0|Links
EI
Keywords:
Sparse random graphMarkov Chain Monte CarloSampling colouringshigh probabilityconstant numberMore(8+)

Abstract:

In this work we present a simple and efficient algorithm which, with high probability, provides an almost uniform sample from the set of proper k-colourings on an instance of sparse random graphs G"n","d"/"n, where k=k(d) is a sufficiently large constant. Our algorithm is not based on the Markov Chain Monte Carlo method (M.C.M.C.). Instea...More

Code:

Data:

Your rating :
0

 

Tags
Comments