Analysis of the Greedy List Coloring Algorithm on a Random Graph

Abstract

As a special project for Spring and Summer 2007 David Pollard and I have been studying a graph coloring algorithm proposed by Achlioptas and Molloy (1997). By relying on heuristic arguments, they claimed to be able to find the probability of success for a proposed graph coloring algorithm on Erdös-Rényi graphs. This paper is a progress report detailing our attempts to rigorously derive similar success-probabilities in the special case of the 3-color problem.

1 Figure or Table

Cite this paper

@inproceedings{Kane2007AnalysisOT, title={Analysis of the Greedy List Coloring Algorithm on a Random Graph}, author={Michael Kane}, year={2007} }