Abstract

In this work some preliminary numerical results obtained by large scale simulations of the sequential dynamics of a neural network model for the graph bisection problem on random geometrically connected graphs are presented. It can be concluded that the sequential dynamic is a low cost, effective and very fast local minima optimization heuristic for the Graph Bisection Problem. © 2005 Elsevier B.V. All rights reserved.