Coloring Random Graphs — an Algorithmic Perspective
Algorithmic Graph Coloring and Random Graphs have long become one of the most prominent branches of Combinatorics and Combinatorial Optimization. It is thus very natural to expect that their mixture will produce quite many very attractive, diverse and challenging problems. And indeed, the last thirty or so years witnessed rapid growth of the field of Algorithmic Random Graph Coloring, with many researchers working in this area and bringing there their experience from different directions of Combinatorics, Probability and Computer Science. One of the most distinctive features of this field is indeed the diversity of tools and approaches used to tackle its central problems.
KeywordsGreedy Algorithm Random Graph Chromatic Number Graph Coloring Common Neighbor
Unable to display preview. Download preview PDF.
- N. Alon and N. Kahale A spectral technique for coloring random 3-colorable graphs Proc. of the 26thAnnual ACM Symposium on Theory of Computing (STOC’94), 346–355.Google Scholar
- N. Alon, M. Krivelevich and V. H. Vu On the concentration of eigenvalues of random symmetric matrices Israel Journal of Mathematics, in press.Google Scholar
- J. Culberson and I. Gent Well out of reach: why hard problems are hard Technical report APES-13–1999, APES Research Group, 1999. Available from:http://www.cs.strath.ac.uk/apes/apesreports.html.
- U. Feige and J. Kilian Zero knowledge and the chromatic number Proc. 11th IEEE Conf. Comput. Complexity, IEEE (1996), 278–287.Google Scholar
- U. Feige and J. Kilian Heuristics for semirandom graph problems J. Computer and System Sciences, to appear.Google Scholar
- M. Fürer, C. R. Subramanian and C. E. Veni Madhavan Coloring random graphs in polynomial expected time Algorithms and Comput. (Hong Kong 1993), Lecture Notes Comp. Sci. 762, Springer, Berlin, 1993, 31–37.Google Scholar
- V. Guruswami and S. Khanna On the hardness of 4-coloring a 3-colorable graph Proc. 15thAnnual IEEE Conf. on Computational Complexity, IEEE Comput. Soc. Press, Los Alamitos, 2000, 188–197.Google Scholar
- A. Juels and M. Peinado, Hiding cliques for cryptographic security Proc. of the Ninth Annual ACM-SIAM SODA ACM Press (1998), 678–684.Google Scholar
- R. M. Karp, Probabilistic analysis of some combinatorial search problems, In: Algorithms and Complexity: New Directions and Recent Results J. F. Traub, ed., Academic Press, New York, 1976, pp. 1–19.Google Scholar
- H. Kierstead Coloring graphs on-line Online algorithms (Schloss-Dagstuhl 1996), Lecture Notes in Computer Science 1442, Springer, Berlin, 1998,281– 305.Google Scholar
- M. Krivelevich and V. H. Vu Approximating the independence number and the chromatic number in expected polynomial time Proc. 27thInt. Colloq. on Automata, Languages and Programming (ICALP’2000), Lecture Notes in Computer Science 1853, Springer, Berlin, 13–24.Google Scholar
- C. J. H. McDiarmid Colouring random graphs badly Graph Theory and Combinatorics (R. J. Wilson, Ed.), Pitman Research Notes in Mathematics, vol. 34, 76–86.Google Scholar
- F. McSherry Spectral partitioning of random graphs Proc. 42ndIEEE Symposium on Found. of Comp. Science (FOCS’01), IEEE Comp. Society, 529–537.Google Scholar
- D. W. Matula On the complete subgraph of a random graph Combinatory mathematics and its applications, Chapel Hill, North Carolina (1970), 356–369.Google Scholar
- M. Molloy Thresholds for colourability and satisfiability in random graphs and Boolean formulae in: Surveys in Combinatorics 2001, London Math. Soc. Lect. Note Ser. 288, Cambridge Univ. Press, Cambridge, 2001.Google Scholar
- J. H. van Lint and R. M. Wilson, A course in combinatorics, Cambridge Univ. Press, Cambridge, 1992.Google Scholar