Abstract
Methods of statistical mechanics are applied to two important NP-complete combinatorial optimization problems. The first is the chromatic number problem, which seeks the minimal number of colors necessary to color a graph such that no two sites connected by an edge have the same color. The second is partitioning of a graph intoq equal subgraphs so as to minimize intersubgraph connections. Both models are mapped into a frustrated Potts model, which is related to theq- state Potts spin glass. For the first problem, we obtain very good agreement with numerical simulations and theoretical bounds using the annealed approximation. The quenched model is also discussed. For the second problem we obtain analytic and numerical results by evaluating the groundstate energy of theq=3 and 4 Potts spin glass using Parisi's replica symmetry breaking. We also perform some numerical simulations to test the theoretical result and obtain very good agreement.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Vannimenus and M. Mezard,J. Phys. Lett. (Paris) 45:L1145 (1984).
M. Mezard and G. Parisi,J. Phys. (Paris) 47:1285 (1986).
G. Baskaran, Y. Fu, and P. W. Anderson,J. Stat. Phys. 45:1 (1986).
Y. Fu and P. W. Anderson,J. Phys. A 19:1605 (1985).
J. P. Bouchaud and P. Le Doussal,Europhys. Lett. 1:91 (1986).
H. Orland,J. Phys. Lett. (Paris) 46:L763 (1985).
M. R. Garey and D. S. Johnson,Computers and Intractability (Freeman, San Francisco, 1979).
K. Appel and W. Haken,Sci. Am. 237:108 (1977);Bull. Am. Math. Soc. 82:711 (1976).
R. M. Karp, inComplexity of Computer Computations, R. E. Miller and J. W. Thather, eds. (Plenum Press, New York, 1972), p. 85.
E. M. Palmer,Graphical Evolution (Wiley, New York, 1985).
P. Erdos and J. Spencer,Probabilistic Methods in Combinatorics (Academic Press, New York, 1974).
B. Bollobas and P. Erdos,Math. Proc. Camb. Phil. Soc. 80:419 (1976).
C. McDiarmid,Ann. Oper. Res. 1:183 (1984).
C. McDiarmid,SIAM J. Comput. 8:1 (1979).
C. McDiarmid,Graph Theory and Combinatorics, R. J. Wilson, ed. (Pitman, London, 1979).
A. Johri and D. W. Matula, Technical Report 82-CSE-6, Southern Methodist University, Dallas, Texas (1982).
F. Y. Wu,Rev. Mod. Phys. 54:235 (1982).
R. Baxter,Exactly Solved Models in Statistical Mechanics (Academic Press, New York, 1982), p. 33.
R. Brout,Phys. Rev. 115:824 (1959).
D. Schweikert and B. Kernighan, inProceedings 11th Design Automation Workshop (1974), p. 57.
J. A. Lukes, Combinatorial solutions to partitioning problem, Ph.D. thesis, Stanford University (1972).
R. M. MacGregor, Memorandum UCB/ERL M78/14, Electronic Research Laboratory, University of California, Berkeley (1978).
T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, inProceedings 25th Annual IEEE Symposium Foundations of Computer Science (1984).
D. Sherrington and S. Kirpatrick,Phys. Rev. Lett. 35:1792 (1975).
G. Parisi,J. Phys. A 13:1101 (1980).
D. Elderfield and D. Sherrington,J. Phys. C 27:L97 (1983).
D. Gross, I. Kanter, and H. Sompolinsky,Phys. Rev. Lett. 55:304 (1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lai, PY., Goldschmidt, Y.Y. Application of statistical mechanics to combinatorial optimization problems: The chromatic number problem andq-partitioning of a graph. J Stat Phys 48, 513–529 (1987). https://doi.org/10.1007/BF01019685
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01019685