Randomly Colouring Sparse Random Graphs using a Constant number of colours

2013.

Cited by: 3|Bibtex|Views1|

Abstract:

In this work we present an efficient algorithm which, with high probability, provides an almost uniform sample from the set of proper χ-colourings of an instance of sparse random graphs Gn,d/n, where χ = χ(d) is a sufficiently large constant. This work improves, asymptotically, the result of Dyer, Flaxman Frieze and Vigoda in (4) where th...More

Code:

Data:

Your rating :
0

 

Tags
Comments