larryp 11/4/2008 |
0 (0) |
1 |
0 |
0 |
English
The Analysis of a List-Coloring Algorithm on a Random Graph (extended abstract)
Dimitris Achlioptas*t
(optasQcs.toronto.edu1
Michael Molloy*$
(mol1oyQcs.toronto.edu)
Abstract
W e introduce a natural k-coloring algorithm and analyze its performance on random graphs with conFor stant expected degree c (Gn,p=c/n). k = 3 our results imply tha ... more>>