A Distributed Algorithm for Max Independent Set Problem Based on Hopfield Networks

  • Giuliano Grossi
  • Roberto Posenato
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2486)


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.


Max Independent Set Hopfield networks synchronous distributed algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Giuliano Grossi
    • 1
  • Roberto Posenato
    • 2
  1. 1.Dipartimento di Scienze dell’InformazioneUniversitá degli Studi di MilanoMilanoItaly
  2. 2.Dipartimento di InformaticaUniversitá degli Studi di VeronaVeronaItaly

Personalised recommendations