By Topic

Simulated annealing for graph bisection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jerrum, Mark ; Dept. of Comput. Sci., Edinburgh Univ., UK ; Sorkin, G.B.

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 Δ⩽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+ε) 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+ε).) We leave open the question of whether annealing is effective for Δ in the range 3/2<⩽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

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993