Exact and approximative algorithms for coloring G(n,p)

Random Structures and Algorithms

Volumn 24, Issue 3, 2004, Pages 259-278

  Coja Oghlan, Amin ^a   Taraz, Anusch ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044274982     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20007     Document Type: Article

References (29)

1. D. Achlioptas and C. Moore, Almost all graphs of degree 4 are 3-colorable, Proc 34th STOC, 2002, pp. 199-208.
2. R. Beigel and D. Eppstein, 3-coloring in time 0(1.3446"): A no-MIS algorithm, Proc 36th FOCS, 1995, pp. 444-452.
3. B. Bollobás, Random graphs, 2nd edition, Cambridge University Press, Cambridge, 2001.
4. A. Coja-Oghlan, Finding large independent sets in polynomial expected time, Proc 20th STAGS, 2003, pp. 511-522.
5. A. Coja-Oghlan, The Lovász number of random graphs, Proc 7th RANDOM, 2003, pp. 228-239.
6. A. Coja-Oghlan, A. Goerdt, A. Lanka, and F. Schädlich, Certifying unsatisfiability of random 2k-SAT formulas using approximation techniques, Proc 14th FCT, 2003, pp. 15-26.
7. A. Coja-Oghlan, C. Moore, and V. Sanwalani, MAX k-CUT and approximating the chromatic number of random graphs, preprint (available from http://www.informatik.hu-berlin.de/~coja/). An extended abstract version has appeared in Proc 30th ICALP, 2003.
8. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Proc 11th IEEE Conf Comput Complexity, 1996, pp. 278-287.
9. U. Feige and J. Kilian, Heuristics for semirandom graph problems, JCSS 63 (2001), 639-671.
10. U. Feige and E. Ofek, Spectral techniques applied to sparse random graphs, Report MCS03-01, Weizmann Institute of Science, Rehovot, Israel, 2003 (available from http://www.wisdom. weizmann.ac.il/math/research.shtml).
11. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties and the fe-SAT problem, J AMS 12 (1999), 1017-1054.
12. J. Friedman and A. Goerdt, Recognizing more unsatisfiable random 3-Sat instances efficiently, Proc 28th ICALP, 2001, pp. 310-321.
13. Z. Füredi and J. Komloś, The eigenvalues of random symmetric matrices, Combinatorica 1 (1981), 233-241.
14. A. Goerdt and M. Krivelevich, Efficient recognition of random unsatisfiable fc-SAT instances by spectral methods, Proc 18th STAGS, 2001, pp. 294-304.
15. A. Goerdt and A. Lanka, Recognizing more random unsatisfiable 3-SAT instances efficiently, Electron Notes Discrete Math 16 (2003).
16. G. Grimmett and C. McDiarmid, On colouring random graphs, Math Proc Cambridge Philos Soc 77 (1975), 313-324.
17. M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, New York, 1988.
18. S. Janson, T. Luczak, and A. Rucinski, Random graphs, Wiley, New York, 2000.
19. F. Juhász, The asymptotic behaviour of Lovász ν function for random graphs, Combinatorica 2 (1982), 269-270.
20. R. Karp, The probabilistic analysis of combinatorial optimization algorithms, Proc Int Cong Mathematicians, 1984, pp. 1601-1609.
21. D. Knuth, The sandwich theorem, Electron J Combin 1 (1994).
22. M. Krivelevich and V. H. Vu, Approximating the independence number and the chromatic number in expected polynomial time, J Combin Optim 6 (2002), 143-155.
23. M. Krivelevich, Deciding k-colorability in expected polynomial time, Inform Process Lett 81 (2002), 1-6.
24. M. Krivelevich, Coloring random graphs-an algorithmic perspective, Proc 2nd Coll Mathematics and Computer Science, Eds. B. Chauvin et al., pp. 175-195. Birkhäuser, Basel, 2002.
25. M. Krivelevich and B. Sudakov, Coloring random graphs, Inform Process Lett 67 (1998), 71-74.
26. L. Kučera, The greedy coloring is a bad probabilistic algorithm, J Algorithms 12 (1991), 674-684.
27. L. Kuhtz, M.Sc. thesis, in preparation.
28. E. L. Lawler, A note on the complexity of the chromatic number problem, Inform Process Lett 5 (1976), 66-67.
29. B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant it-core in a random graph, J Combin Theory Ser B 67 (1996), 111-151.