Sciweavers

FOCS
2004
IEEE
14 years 3 months ago
Randomly Coloring Constant Degree Graphs
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, E...