Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

APPROX
2009
Springer

favoriteEmaildiscussreport

80views Algorithms» more APPROX 2009»

The Glauber Dynamics for Colourings of Bounded Degree Trees

13 years 11 months ago

The Glauber Dynamics for Colourings of Bounded Degree Trees

Download www.cs.toronto.edu

Brendan Lucier, Michael Molloy, Yuval Peres

Real-time Traffic

Algorithms | APPROX 2009 |

claim paper

Related Content

» The Mixing Time of Glauber Dynamics for Colouring Regular Trees

» On randomly colouring locally sparse graphs

» A NonMarkovian Coupling for Randomly Sampling Colorings

» Dobrushin Conditions and Systematic Scan

» The KestenStigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels

» Constraint Satisfaction with Bounded Treewidth Revisited

» Optimal Resource Discovery Paths of Gnutella2

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	APPROX
Authors	Brendan Lucier, Michael Molloy, Yuval Peres

Comments (0)