Solving maximum independent set by asynchronous distributed hopfield-type neural networks

DOI10.1051/ita:2006012zbMath1112.68119OpenAlexW2154085832MaRDI QIDQ3431447

Massimo Marchi, Roberto Posenato, Giuliano Grossi

Publication date: 10 April 2007

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_2_371_0

zbMATH Keywords

Hopfield networksmax independent setasynchronous distributed algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greed is good: Approximating independent sets in sparse and bounded-degree graphs
• A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
• Annealed replication: A new heuristic for the maximum clique problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Neural networks and physical systems with emergent collective computational abilities.
• Reactive local search for the maximum clique problem
• Finding a maximal weighted independent set in wireless networks