Conjecture on the maximum cut and bisection width in random regular graphs

Solvable model of a spin-glass

D. Sherrington and S. Kirkpatrick · 1975

Earlier work this paper cites.

Computers and intractability: A guide to the theory of NP-completeness

M. R. Garey and D. S. Johnson · 1979

Earlier work this paper cites.

The order parameter for spin-glasses: A function on the interval 0–1

G. Parisi · 1980

Earlier work this paper cites.

Mean-field theory of the Potts glass

D. J. Gross, I. Kanter, and H. Sompolinsky · 1985

Earlier work this paper cites.

Application of statistical mechanics to NP-complete problems in combinatorial optimization

Y. Fu and P. W. Anderson · 1986

Earlier work this paper cites.

Spin-Glass Theory and Beyond

M. Mézard, G. Parisi, and M. A. Virasoro · 1987

Earlier work this paper cites.

Mean-field theory of randomly frustrated systems with finite connectivity

M. Mézard and G. Parisi · 1987

Earlier work this paper cites.

Graph bipartitioning and the Bethe spin glass

D. Sherrington and K. Y. M Wong · 1987

Earlier work this paper cites.

Graph bipartitioning and spin glasses on a random network of fixed finite valence

K. Y. M. Wong and D. Sherrington · 1987

Earlier work this paper cites.

Graph optimization problems and the Potts glass

I. Kanter and H. Sompolinsky · 1987

Earlier work this paper cites.

The isoperimetric number of random regular graphs

B. Bollobas · 1988

Earlier work this paper cites.

Graph partitioning and dilute spin glasses: the minimum cost solution

K. Y. M. Wong, D. Sherrington, P. Mottishaw, R. Dewar, and C. DeDominicis · 1988

Earlier work this paper cites.

On bounds of the bisection width of cubic graphs

A. V. Kostochka and L. S. Melnikov · 1992

Earlier work this paper cites.

Recent directions in netlist partitioning – a survey

C. J. Alpert and A. B. Kahng · 1995

Cited alongside, same era.

A multilevel algorithm for partitioning graphs

B. A. Hendrickson and R. Leland · 1995

Cited alongside, same era.

Maximum cuts and largest bipartite subgraphs

S. Poljak and Z. Tuza · 1995

Cited alongside, same era.

Extremal Optimization and graph partitioning at the percolation threshold

S. Boettcher · 1999

Cited alongside, same era.

Nature’s way of optimizing

S. Boettcher and A. G. Percus · 2000

Cited alongside, same era.

Upper bounds on the bisection width of 3- and 4-regular graphs

B. Monien and R. Preis · 2001

Cited alongside, same era.

The Bethe lattice spin glass revisited

Numerical results for ground states of mean-field spin glasses at low connectivities

S. Boettcher · 2003

Later among the works it cites.

The cavity method at zero temperature

M. Mézard and G. Parisi · 2003

Later among the works it cites.

Constraint satisfaction by survey propagation

A. Braunstein, M. Mézard, M. Weigt, and R. Zecchina · 2003

Later among the works it cites.

New Optimization Algorithms in Physics

A. Hartmann and H. Rieger, editors · 2004

Later among the works it cites.

Spin glass models with ferromagnetically biased couplings on the Bethe lattice: analytic solution and numerical simulations

T. Castellani, F. Krzakala, and F. Ricci-Tersenghi · 2005

Later among the works it cites.

An upper bound for the maximum cut mean value

A. Bertoni, P. Campadelli, and R. Posenato · 2006

Later among the works it cites.