Approximately solving Maximum Clique using neural network and related heuristics


We explore neural network and related heuristic methods for the fast approximate solution of the Maximum Clique problem. One of these algorithms, Mean Field Annealing, is implemented on the Connection Machine CM-5 and a fast annealing schedule is experimentally evaluated on random graphs, as well as on several benchmark graphs. The other algorithms, which… (More)