Colouring random graphs in expected polynomial time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 487-498

  Coja Oghlan, Amin ^a   Taraz, Anusch ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; GRAPH THEORY; POLYNOMIALS;

CHROMATIC NUMBER; EXPECTED TIME; INDEPENDENCE NUMBER; POLYNOMIAL-TIME; RANDOM GRAPHS;

POLYNOMIAL APPROXIMATION;

EID: 35248830778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_43     Document Type: Article

References (29)

1. Achlioptas, D., Molloy, M.: The analysis of a list-coloring algorithm on a random graph, Proc. 38th. IEEE Symp. Found. of Comp. Sci. (1997) 204-212
2. Beck, L.L., Matula, D.W.: Smallest-last ordering and clustering and graph coloring algorithms, J. ACM 30 (1983) 417-427
3. n): a no-MIS algorithm, Proc. 36th. IEEE Symp. Found. of Comp. Sci. (1995) 444-453
4. Bollobás, B.: Random graphs, 2nd edition, Cambridge University Press 2001
5. Coja-Oghlan, A.: Finding sparse induced subgraphs of semirandom graphs. Proc. 6th. Int. Workshop Randomization and Approximation Techniques in Comp. Sci. (2002) 139-148
6. Coja-Oghlan, A.: Finding large independent sets in expected polynomial time. To appear in Proc. STACS 2003
7. Dyer, M., Frieze, A.: The solution of some NP-hard problems in polynomial expected time, J. Algorithms 10 (1989) 451-489
8. Eppstein, D.: Small maximal independent sets and faster exact graph coloring. To appear in J. Graph Algorithms and Applications
9. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. Proc. 11. IEEE Conf. Comput. Complexity (1996) 278-287
10. Feige, U., Kilian, J.: Heuristics for semirandom graph problems. J. Comput. and System Sci. 63 (2001) 639-671
11. Füredi, Z., Komloś, J.: The eigenvalues of random symmetric matrices, Combinatorica 1 (1981) 233-241
12. Fürer, M., Subramanian, C.R., Veni Madhavan, C.E.: Coloring random graphs in polynomial expected time. Algorithms and Comput. (Hong Kong 1993), Springer LNCS 762, 31-37
13. Frieze, A., McDiarmid, C.: Algorithmic theory of random graphs. Random Structures and Algorithms 10 (1997) 5-42
14. Grimmett, G., McDiarmid, C.: On colouring random graphs. Math. Proc. Cam. Phil. Soc 77 (1975) 313-324
15. Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer 1988
16. Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley 2000
17. Juhasz, F.: The asymptotic behaviour of Lovász θ function for random graphs, Combinatorica 2 (1982) 269-280
18. Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. Proc. of the 35th. IEEE Symp. on Foundations of Computer Science (1994) 2-13
19. Karp, R.: Reducibility among combinatorial problems. In: Complexity of computer computations. Plenum Press (1972) 85-103.
20. Karp, R.: The probabilistic analysis of combinatorial optimization algorithms. Proc. Int. Congress of Mathematicians (1984) 1601-1609.
21. Knuth, D.: The sandwich theorem, Electron. J. Combin. 1 (1994)
22. Krivelevich, M., Vu, V.H.: Approximating the independence number and the chromatic number in expected polynomial time. J. of Combinatorial Optimization 6 (2002) 143-155
23. Krivelevich, M.: Deciding k-colorability in expected polynomial time, Information Processing Letters 81 (2002) 1-6
24. Krivelevich, M.: Coloring random graphs - an algorithmic perspective, Proc. 2nd Coll. on Mathematics and Computer Science, B. Chauvin et al. Eds., Birkhauser, Basel (2002) 175-195.
25. Krivelevich, M., Sudakov, B.: Coloring random graphs. Informat. Proc. Letters 67 (1998) 71-74
26. Kučera, L.: The greedy coloring is a bad probabilistic algorithm. J. Algorithms 12 (1991) 674-684
27. Lawler, E.L.: A note on the complexity of the chromatic number problem, Information Processing Letters 5 (1976) 66-67
28. Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant k-core in a random graph. JCTB 67 (1996) 111-151
29. Prömel, H.J., Steger, A.: Coloring clique-free graphs in polynomial expected time, Random Str. Alg. 3 (1992) 275-302