The Metropolis algorithm for graph bisection

This publication has 20 references indexed in Scilit:

• Book Review — An Introduction to Probability Theory and its Applications 2, 2nd ed.
  Published by World Scientific Pub Co Pte Ltd ,2004
• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Large Cliques Elude the Metropolis Process
  Random Structures & Algorithms, 1992
• The effect of the density of states on the Metropolis algorithm
  Information Processing Letters, 1991
• The solution of some random NP-hard problems in polynomial expected time
  Journal of Algorithms, 1989
• Approximating the Permanent
  SIAM Journal on Computing, 1989
• The time complexity of maximum matching by simulated annealing
  Journal of the ACM, 1988
• Graph bisection algorithms with good average case behavior
  Combinatorica, 1987
• Convergence and finite-time behavior of simulated annealing
  Advances in Applied Probability, 1986
• Optimization by Simulated Annealing
  Science, 1983