2310 search results - page 5 / 462 » Coloring Random Graphs |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
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...
AUSAI
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...