Search Sciweavers | Sciweavers

14

RSA
2006

88views more RSA 2006»

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

13 years 4 months ago

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 »

10

click to vote

JCT
2010

111views more JCT 2010»

Anti-Ramsey properties of random graphs

13 years 3 months ago

Download www-math.mit.edu

We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...

Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliffor...

claim paper

Read More »

12

click to vote

IJAMCIGI
2010

94views more IJAMCIGI 2010»

A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition

12 years 11 months ago

Download www.info.univ-angers.fr

We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...

Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover

claim paper

Read More »

13

click to vote

STOC
1994
ACM

125views Algorithms» more STOC 1994»

A spectral technique for coloring random 3-colorable graphs (preliminary version)

13 years 9 months ago

Download www.cs.tau.ac.il

Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...

Noga Alon, Nabil Kahale

claim paper

Read More »

10

click to vote

STOC
2007
ACM

110views Algorithms» more STOC 2007»

Randomly coloring planar graphs with fewer colors than the maximum degree

14 years 5 months ago

Download www.cc.gatech.edu

Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda

claim paper