K-way neural network graph partitioning with separator vertices

Abstract.

A neural network for partitioning graphs into any number of subgraphs using a k-way procedure is presented. The resulting neural network optimises all subgraphs so that they contain approximately the same number of vertices with the exception of a `separator' subgraph. The latter separates all the other subgraphs and is optimised to contain a minimum number of vertices. Expressions for the neuron link weights for such a network are derived analytically, and the recall mechanism of the mean field theorem neural network is used to obtain the graph partitioning. Applications focus on partitioning graphs associated with finite element meshes which, together with parallel domain decomposition solution methods, provide the motivation for this work.