Search Sciweavers | Sciweavers

75 search results - page 1 / 15

» Randomly Coloring Constant Degree Graphs

click to vote

FOCS
2004
IEEE

103views Theoretical Computer Science» more FOCS 2004»

Randomly Coloring Constant Degree Graphs

14 years 1 months ago

Download www.math.cmu.edu

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...

claim paper

Read More »

click to vote

RSA
2006

88views more RSA 2006»

Randomly coloring sparse random graphs with fewer colors than the maximum degree

13 years 9 months ago

Download www.math.cmu.edu

We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...

Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...

claim paper

Read More »

click to vote

STOC
2002
ACM

121views Algorithms» more STOC 2002»

Almost all graphs with average degree 4 are 3-colorable

14 years 10 months ago

Download users.soe.ucsc.edu

We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...

Dimitris Achlioptas, Cristopher Moore

claim paper

Read More »

click to vote

STOC
2007
ACM

110views Algorithms» more STOC 2007»

Randomly coloring planar graphs with fewer colors than the maximum degree

14 years 10 months ago

Download www.cc.gatech.edu

Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda

claim paper

Read More »