On the phase transitions of graph coloring and independent sets

Physica A: Statistical Mechanics and its Applications

Volumn 343, Issue 1-4, 2004, Pages 401-423

  Barbosa, Valmir C ^a   Ferreira, Rubens G ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Acyclic orientations; Graph coloring; Maximum independent sets; Phase transitions

Indexed keywords

CORRELATION METHODS; GRAPH THEORY; NUMBER THEORY; OPTIMIZATION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; SET THEORY;

ACYCLIC ORIENTATIONS; GRAPH COLORING; MAXIMUM INDEPENDENT SETS;

PHASE TRANSITIONS;

EID: 4544330463     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2004.05.055     Document Type: Article

References (48)

1. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, NY, 1979.
2. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, NY, 1972, pp. 85-103.
3. D.E. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability, American Mathematical Society, Providence, RI, 1996.
4. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, MIT Press, Cambridge, MA, 1990, pp. 67-161.
5. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-1991, 1991, pp. 331-337.
6. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI-1992, 1992, pp. 459-465.
7. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, L. Troyansky, Determining computational complexity from characteristic 'phase transitions', Nature 400 (1999) 133-137.
8. A. Giordana, L. Saitta, Phase transitions in relational learning, Mach. Learn. 41 (2000) 217-251.
9. J. Culberson, I. Gent, Frozen development in graph coloring, Theoret. Comput. Sci. 265 (2001) 227-264.
10. S. Bornholdt, H.G. Schuster (Eds.), Handbook of Graphs and Networks, Wiley-VCH, Weinheim, Germany, 2003.
11. J. Slaney, T. Walsh, Backbones in optimization and approximation, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-2001, 2001, pp. 254-259.
12. A.K. Hartmann, M. Weigt, Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs, Theoret. Comput. Sci. 265 (2001) 199-225.
13. D.S. Johnson, M.A. Trick, Introduction to the second DIMACS challenge: cliques, coloring, and satisfiability, in: D.S. Johnson, M.A. Trick, Cliques, Coloring, and Satisfiability, American Mathematical Society, Providence, RI, 1996, pp. 1-7.
14. F.Y. Wu, The Potts model, Rev. Mod. Phys. 54 (1982) 235-268.
15. M. Weigt, A.K. Hartmann, Minimal vertex covers on finite-connectivity random graphs: a hard-sphere lattice-gas picture, Phys. Rev. E 63 (2001) 056127.
16. A.D. Scott, A.D. Sokal, The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma, cond-mat/0309352 at arXiv.org, 2003.
17. B. Bollobás, Random Graphs, 2nd Edition, Cambridge University Press, Cambridge, UK, 2001.
18. M.A. Trick, http://mat.gsia.cmu.edU/COLOR/solvers/trick.c.
19. D. Brélaz, New methods to color vertices of a graph, Commun. ACM 22 (1979) 251-256.
20. B. Bollobás, Modern Graph Theory, Springer, New York, NY, 1998.
21. G. Lebl, chromatie.c from http://www.5z.com/jirka/linux.html.
22. R.P. Stanley, Acyclic orientations of graphs, Discrete Math. 5 (1973) 171-178.
23. R.P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge, UK, 1999.
24. B. Lass, Orientations acycliques et le polynôme chromatique, Europ. J. Combin. 22 (2001) 1101-1123.
25. K.-P. Vo, Graph colorings and acyclic orientations, Linear Multilinear Algebra 22 (1987) 161-170.
26. R.P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge University Press, Cambridge, UK, 1997.
27. R.W. Deming, Acyclic orientations of a graph and chromatic and independence numbers, J. Combin. Theory Ser. B 26 (1979) 101-110.
28. B. Roy, Nombre chromatique et plus longs chemins d'un graphe, Revue AFIRO 1 (1967) 127-132.
29. T. Gallai, On directed paths and circuits, in: P. Erdos, G. Katona (Eds.), Theory of Graphs, Academic Press, New York, NY, 1968, pp. 115-118.
30. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, The Netherlands, 1976.
31. V.C. Barbosa, J.L. Szwarcfiter, Generating all the acyclic orientations of an undirected graph, Inform. Process. Lett. 72 (1999) 71-74.
32. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press, Cambridge, MA, 2001.
33. W. Feller, An Introduction to Probability Theory and Its Applications, 3rd Edition, Vol. 1, Wiley, New York, NY, 1968.
34. V.C. Barbosa, C.A.G. Assis, J.O. do Nascimento, Two novel evolutionary formulations of the graph coloring problem, J. Combin. Optim. 8 (2004) 41-63.
35. V.C. Barbosa, E. Gafni, Concurrency in heavily loaded neighborhood-constrained systems, ACM Trans. Progr. Lang. Systems 11 (1989) 562-584.
36. V.C. Barbosa, An Atlas of Edge-Reversal Dynamics, Chapman & Hall/CRC, London, UK, 2000.
37. V.C. Barbosa, The interleaved multichromatic number of a graph, Ann. Combin. 6 (2002) 249-256.
38. S. Boettcher, A.G. Percus, Optimization with extremal dynamics, Phys. Rev. Lett. 86 (2001) 5211-5214.
39. R. Mulet, A. Pagnani, M. Weigt, R. Zecchina, Coloring random graphs, Phys. Rev. Lett. 89 (2002) 268701-1-4.
40. D.S. Johnson, ftp://dimacs.rutgers.edu/pub/dsj/clique/dfmax.c.
41. R. Carraghan, P.M. Pardalos, An exact algorithm for the maximum clique problem, Oper. Res. Lett. 9 (1990) 375-382.
42. J.M. Nielsen, On the number of maximal independent sets in a graph, Technical Report BRICS RS-02-15, BRICS, Department of Computer Science, University of Aarhus, Aarhus, Denmark, April 2002.
43. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
44. R.P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950) 161-165.
45. B.V. Cherkassky, A.V. Goldberg, http://www.avglab.com/andrew/soft/hipr.tar.
46. B.V. Cherkassky, A.V. Goldberg, On implementing push-relabel method for the maximum flow problem, Algorithmica 19 (1997) 390-410.
47. V.C. Barbosa, L.C.D. Campos, A novel evolutionary formulation of the maximum independent set problem, Technical Report ES-615/03, COPPE, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, September 2003.
48. M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, Cambridge, MA, 1996.