The Metropolis algorithm for graph bisection

Mark Jerrum, Gregory B. Sorkin
1998 Discrete Applied Mathematics  
We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing can. with high probability and in polynomial time, find the optimal bisection of a random graph in v. (By using a slightly modified neighborhood structure, the number of steps can bc reduced to O(n'+' ). ) We leave open the question of whether annealing is clrective for 11 in the range 1 Corresponding author.
doi:10.1016/s0166-218x(97)00133-9 fatcat:t5hmcp5jdjgqdexpjzutk4r2gi