Boettcher, Stefan - In: Physica A: Statistical Mechanics and its Applications 266 (1999) 1, pp. 100-103
The partitioning of random graphs is investigated numerically using “simulated annealing” and “extremal optimization …”. While generally in an NP-hard problem, it is shown that the optimization of the graph partitions is particularly difficult … “simulated annealing” is found to diverge in the thermodynamic limit. On the other hand, “extremal optimization”, a new general …