Algorithms for coloring semi-random graphs

Random Structures and Algorithms

Volumn 13, Issue 2, 1998, Pages 125-158

  Subramanian, C R ^a,d   Fürer, Martin ^b   Veni Madhavan, C E ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

^b The Pennsylvania State University   (United States)

^c INDIAN INSTITUTE OF SCIENCE   (India)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Complexity classes; Graph coloring; Polynomial average time algorithms; Probabilistic analysis; Random graphs; Semi random graphs

Indexed keywords

EID: 0042279689     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199809)13:2<125::AID-RSA2>3.0.CO;2-T     Document Type: Article

References (35)

1. A. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.
2. N. Alon and N. Kahale, A spectral technique for coloring random 3-colorable graphs, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994, pp. 346-355.
3. M. Bellare and M. Sudan, Improved non-approximability results, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994, pp. 184-193.
4. B. Berger and J. Rompel, A better performance guarantee for approximate graph coloring, Algorithmica 5, 459-466 (1988).
5. A. Blum, Some tools for approximate 3-coloring, Proceedings of the Thirty-First Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 554-562.
6. A. Blum, New approximation algorithms for graph coloring, J. ACM, 41, 470-516 (1994).
7. A. Blum, Algorithms for approximate graph coloring, Ph.D. thesis, Massachusetts Institute of Technology, May 1991; MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-506, 1991.
8. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett., 16, 49-53 (1997).
9. A. Blum and J. Spencer, Coloring random and semi-random k-colorable graphs, J. Algorithms, 19, 204-234 (1995).
10. R. Boppana and J. Spencer, A useful elementary correlation inequality, J. Combin. Theory, Ser. A, 50, 305-307 (1989).
11. M. E. Dyer and A. M. Frieze, The solution of some random NP-hard problems in polynomial expected time, J. Algorithms, 10, 451-489 (1989).
12. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity, 1996, pp. 24-27.
13. A. M. Freize and C. McDiarmid, Algorithmic theory of random graphs, Random. Struct. Algorithms, 10, 5-42 (1997).
14. M. Fürer, Improved hardness results for approximating the chromatic number, Proceedings of the Thirty-Sixth Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 414-421.
15. M. Fürer and C. R. Subramanian, Coloring random graphs, Proceedings of the Third Scandinavian Workshop on Algorithmic Theory, Springer-Verlag, Lecture Notes in Computer Science, 621, 1992, pp. 284-291.
16. M. Fürer, C. R. Subramanian, and C. E. Veni Madhavan, Coloring random graphs in polynomial expected time, Proceedings of the Fourth International Symposium on Algorithms and Computation, Springer-Verlag, Lecture Notes in Computer Science, 762, 1993, pp. 31-37.
17. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freemann, San Francisco, 1978.
18. M. R. Garey, D. S. Johnson, and H. G. So, An application of graph coloring to printed circuit testing, IEEE Trans. Circuits Syst., 23, 591-598 (1976).
19. G. R. Grimmett and C. J. H. McDiarmid, On colouring random graphs, Math. Proc. Cambridge Philos. Soc., 77, 313-324 (1985).
20. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds, Inform. Process. Lett., 33, 305-308 (1989).
21. M. M. Halldórsson, A still better performance guarantee for approximating graph coloring, Inform. Process. Lett., 45, 19-23 (1993).
22. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. Syst. Sci., 9, 256-278 (1974).
23. D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semi-definite programming, Proceedings of the Thirty-Fifth Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 2-13.
24. R. Karp, The probabilistic analysis of some combinatorial search algorithms, in Algorithms and Complexity, J. F. Traub, Ed., Academic press, New York, 1976, pp. 1-19.
25. S. Khanna, N. Linial, and S. Safra, On the hardness of approximating the chromatic number, Proceedings of the Second Israeli Symposium on Theory of Computing and Systems, 1993, pp. 250-260.
26. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM, 41, 960-981 (1994).
27. S. Mahajan and H. Ramesh, Derandomizing semidefinite programming based approximation algorithms, Proceedings of the Thirty-Sixth Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 162-169.
28. N. Mehta, The application of a graph coloring method to an examination scheduling problem, Interfaces, 11, 57-64 (1981).
29. M. Santha and U. V. Vazirani, Generating quasi-random sequences from semi-random sources, J. Comput. Syst. Sci., 33, 75-87 (1986).
30. C. R. Subramanian, Improved algorithms for coloring random graphs, Proceedings of the Fifth International Symposium on Algorithms and Computation, Springer-Verlag, Lecture Notes in Computer Science, 834, 1994.
31. C. R. Subramanian, Minimum coloring random and semi-random graphs in polynomial expected time, Proceedings of the Thirty-Sixth Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 463-472.
32. C. R. Subramanian, Algorithms for coloring random and semi-random graphs, Ph.D. thesis, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 1994.
33. C. R. Subramanian and C. E. Veni Madhavan, Coloring semi-random graphs in polynomial expected time, Proceedings of the Fourteenth Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag, Lecture Notes in Computer Science, 880, 1994, pp. 137-148.
34. J. S. Turner, Almost all k-colorable graphs are easy to color, J. Algorithms, 9, 63-82 (1988).
35. A. Wigderson, Improving the performance guarantee for approximate graph coloring, J. ACM, 30(4), 729-735 (1983).