Optimal cuts in graphs and statistical mechanics

Mathematical and Computer Modelling

Volumn 26, Issue 8-10, 1997, Pages 1-11

  D'Auriac, J C ANGLÈS ^a   Preissmann, M ^b   Leibniz Imag, A Sebo ^b  

^a LABORATOIRE DE CRISTALLOGRAPHIE   (France)

^b NONE   (France)

Author keywords

Discrete optimisation; Ground state properties; Optimal cuts; Statistical mechanics

Indexed keywords

ALGORITHMS; FERROMAGNETIC MATERIALS; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

GROUND STATE PROPERTIES; OPTIMAL CUTS; RANDOM FIELD ISING MODEL; SPIN GLASS PROBLEM;

STATISTICAL MECHANICS;

EID: 0031259119     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(97)00195-7     Document Type: Conference Paper

References (42)

1. E. Ising, Beitrag zur Theorie des Ferromagnetismus, Z. Physik 31, 253-258 (1925).
2. F.Y. Wu, The Potts model, Rev. Mod. Phys. 54, 235-268 (1982).
3. K.H. Fisher and J.A. Hertz, Spin glasses, Cambridge Studies in Magnetism, Vol. l, Cambridge University Press, (1991).
4. M. Mézard, G. Parisi and M. Virasoro, Spin glass theory and beyond, World Scientific Lecture Notes in Physics, Vol. 9, World Scientific, Singapore, (1987).
5. M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, Freemann, San Francisco, (1979).
6. R.M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, (Edited by R.E. Miller and J.W. Thatcher), pp. 85-103, Plenum Press, New York, (1972).
7. M.R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1, 237-267 (1976).
8. th Ann. ACM Symp. on Theory of Computing, pp. 253-264, (1978).
9. F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Computing 4, 221-225 (1975).
10. G.I. Orlova and Y.G. Dorfman, Finding the maximal cut in a graph, Engrg. Cybernetics 10, 502-504 (1972).
11. 5, Operations Research Letters 2, 107-111 (1983).
12. M. Grötschel and W.R. Pulleyblank, Weakly bipartite graphs and the max-cut problem, Operations Research Letters 1, 23-27 (1981).
13. L.R. Ford and D.R. Fulkerson, Maximal flow through a network, Canad. J. of Math. 8, 399-404 (1956).
14. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows, Prentice Hall, New Jersey, (1993).
15. H. Nagamochi and T. Ibaraki, Computing edge-connectivity in multigraphs and capacited graphs, SIAM J. Disc. Math. 5, 54-66 (1992).
16. th ACM-SIAM Symposium on Discrete Algorithms, (1993).
17. W.H. Cunningham, The optimal multiterminal cut problem, Dimacs Series in Discrete Mathematics and Theoretical Computer Science 5, 105-119 (1991).
18. O. Goldschmidt and D.S. Hochbaum, A polynomial algorithm for the k-cut problem for fixed k, Math. Operations Research 19, 24-37 (1994).
19. E. Dalhaus, D. Johnson, C. Papadimitriou, P. Seymour and M. Yannakakis, The complexity of multidimensional cuts, Siam J. Comp. 23, 864-894 (1994).
20. G. Toulouse, Theory of frustration effect in spin glasses: I, Comm. Phys. 2, 115-120 (1977).
21. S. Kirkpatrick, C. Gelatt and M. Vecchi, Optimization by simulated annealing, Science 220, 671-680 (1983).
22. A. Goldberg and R.E. Tarjan, A new approach to the maximum-flow problem, Journal of the Association for Computing Machinery 35, 921-940 (1988).
23. A. Ogielski, Integer optimization and zero-temperature fixed point in Ising random-field systems, Phys. Rev. Lett. 57, 1251-1254 (1986).
24. J.C. Anglès d'Auriac and N. Sourlas, The 3-d random field Ising model at zero temperature, Europhys. Lett. 39, 473-480 (1997).
25. J.-C. Picard and M. Queyranne, On the structure of all minimum cuts in a network and applications, Mathematical Programming Study 13, 8-16 (1980).
26. A. Ramanathan and C.J. Colbourn, Counting almost minimum cutsets with reliability applications, Math. Prog. 39, 253-261 (1987).
27. M.L. Gardner, An algorithm to aid in the design of large scale networks, Large Scale Systems 8, 147-156 (1985).
28. M.O. Ball and J.S. Provan, Calculating bounds on reachability and connectedness in stochastic networks, Networks 13, 253-278 (1983).
29. L. Lovász and M.D. Plummer, Matching Theory, North-Holland, Amsterdam, (1986).
30. J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, J. Res. Nat. Bur. Standards Sect. B 69, 125-130 (1965).
31. J.C. Anglès d'Auriac and R. Maynard, On the random antiphase state in the ±J spin glass model in two dimensions, Solid State Communications 49, 785-790 (1984).
32. F. Barahona, R. Maynard, R. Rammal and J.P. Uhry, Morphology of ground states of two dimension frustration model, J. Phys. A 15, 673-699 (1982).
33. I. Bieche, R. Maynard, R. Rammal and J.P. Uhry, On the ground states of the frustration model of a spin glass by a matching method of graph theory, J. Phys. A13, 2553-2576 (1980).
34. D.C. Mattis, Solvable spin systems with random interactions, Physics Letters A56, 421-422 (1976).
35. F. Barahona, On some weakly bipartite graphs, Operations Research Letters 2, 239-242 (1983).
36. P. Hansen, Methods of nonlinear 0-1 programming, Ann. Disc. Math. 5, 53-70 (1979).
37. J.C. Anglès d'Auriac, M. Preissmann and R. Rammal, The Random Field Ising Model: Algorithmic complexity and phase transition, J. Physique Lett. 46, 173-180 (1985).
38. R. Melin, J.C. Anglès d'Auriac, B. Douçot and P. Chandra, Glassy behavior in the ferromagnetic Ising model on a Cayley tree, J. Phys. A: Math. Gen. 29, 573-582 (1996).
39. W. Krauth and M. Mézard, Aging without disorder on long time scales, Z. Phys. B 97, 127-134 (1995).
40. F.R.K. Chung, Labelings of graphs, Graph Theory 3, 151-168 (1988).
41. th IEEE Symposium on Foundation of Computer Science, pp. 274-281, (1983).
42. T. Lengauer, Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees, Siam J. Alg. Disc. Math. 3, 99-113 (1982).