Skip to main content
Article thumbnail
Location of Repository

Simulated annealing for graph bisection

By Mark Jerrum and Gregory B. Sorkin


We resolve in the affirmative a question of R.B. Boppana and T. Bui: whether simulated annealing can with high probability and in polynomial time, find the optimal bisection of a random graph an Gnpr when p-r=(ΘnΔ-2) for Δ&les;2. (The random graph model Gnpr specifies a “planted” bisection of density r, separating two n/2-vertex subsets of slightly higher density p.) We show that simulated “annealing” at an appropriate fixed temperature (i.e., the Metropolis algorithm) finds the unique smallest bisection in O(n2+&epsi;) steps with very high probability, provided Δ>11/6. (By using a slightly modified neighborhood structure, the number of steps can be reduced to O(n1+&epsi;).) We leave open the question of whether annealing is effective for Δ in the range 3/2<&les;11/6, whose lower limit represents the threshold at which the planted bisection becomes lost amongst other random small bisections. It also remains open whether hillclimbing (i.e. annealing at temperature 0) solves the same problem

Topics: QA75 Electronic computers. Computer science
Year: 1993
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.