Deciding k-colorability in expected polynomial time

Abstract For every fixed k ⩾3 we describe an algorithm for deciding k -colorability, whose expected running time in polynomial in the probability space G ( n , p ) of random graphs as long as the edge probability p = p ( n ) satisfies p ( n )⩾ C / n , with C = C ( k ) being a sufficiently large constant.

[1]  Tomasz Luczak.  The chromatic number of random graphs , 1991, Comb..

[2]  Noga Alon,et al.  Approximating the independence number via theϑ-function , 1998, Math. Program..

[3]  V. Vu,et al.  Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time , 2000, J. Comb. Optim..

[4]  Martin E. Dyer,et al.  The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.

[5]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[6]  Edward A. Bender,et al.  A Theoretical Analysis of Backtracking in the Graph Coloring Problem , 1985, J. Algorithms.

[7]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[8]  C. R. Subramanian,et al.  Coloring Random Graphs in Polynomial Expected Time , 1993, ISAAC.

[9]  Herbert S. Wilf,et al.  Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem , 1984, Inf. Process. Lett..

[10]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[11]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[12]  Béla Bollobás,et al.  The chromatic number of random graphs , 1988, Comb..

[13]  Michael Krivelevich,et al.  Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time , 2000, ICALP.

[14]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).