A simple algorithm for random colouring G(n, d/n) using (2+ε)d colours

SODA '12: ACM-SIAM Symposium on Discrete Algorithms Kyoto Japan January, 2012, pp. 272-280, 2011.

Cited by: 10|Bibtex|Views0|Links
EI
Keywords:
random k-colouringuniform distributionmcmc algorithmapproximate random k-colouringrandom colouring gMore(14+)

Abstract:

Approximate random k-colouring of a graph G = (V, E) is a very well studied problem in computer science and statistical physics. It amounts to constructing a k-colouring of G which is distributed close to Gibbs distribution, i.e. the uniform distribution over all the k-colourings of G. Here, we deal with the problem when the underlying gr...More

Code:

Data:

Your rating :
0

 

Tags
Comments