Coloring random graphs in polynomial expected time
We consider the problem of vertex coloring random k-colorable graphs using k colors. We consider two different models for generating random graphs. We give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner  and the second model is discussed in Dyer and Frieze . Our results improve the these current results for this problem by removing the assumption of constant edge probability used in these models.
Unable to display preview. Download preview PDF.
- A. Blum, Some Tools for Approximate 3-Coloring, FOCS, 1990, 554–562.Google Scholar
- A. Blum and J. Spencer, Coloring Random and Semi-Random k-Colorable Graphs, Submitted to Journal of Algorithms.Google Scholar
- M.E. Dyer and A.M. Frieze, The solution of Some Random NP-Hard Problems in Polynomial Expected Time, J. Alg., 10, 1989, 451–489.Google Scholar
- M.Furer and C.R. Subramanian, Coloring Random Graphs, SWAT,1992.Google Scholar
- C. Lund and M. Yannakakis, On the Hardness of Approximating Minimization Problems, Proc. of Worshop on Approx. Algos. New Delhi, Dec 1992.Google Scholar
- J.S. Turner, Almost All k-colorable Graphs are Easy to Color, J. Alg., 9, 1988, 63–82.Google Scholar