A distributed algorithm for max independent set problem based on Hopfield networks

Abstract

A distributed algorithm to find a maximal independent set of an undirected graph is proposed. It is borrowed by a centralized one and it is based on a sequence of Hopfield neural networks. We refer to the synchronous model of distributed computation in which the topology is described by the graph. We give an upper bound on the number of messages sent during the entire process of computation. To test the algorithm we experimentally compare it with a probabilistic heuristic derived by Ant Colony Optimization technique and with the standard greedy algorithm. © 2002 Springer-Verlag Berlin Heidelberg.