An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning

DOI10.1162/089976603321891828zbMath1085.68654OpenAlexW2142570057WikidataQ51638921 ScholiaQ51638921MaRDI QIDQ4816960

Rong-Long Wang, Zheng Tang, Qi Ping Cao

Publication date: 14 September 2004

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/089976603321891828

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• DIMACS

Cites Work

• An exact algorithm for the maximum clique problem
• Approximation algorithms for combinatorial problems
• The maximum clique problem
• Finding a Maximum Clique in an Arbitrary Graph
• A global optimization approach for solving the maximum clique problem
• Keller’s cube-tiling conjecture is false in high dimensions
• Neurons with graded response have collective computational properties like those of two-state neurons.
• A branch and bound algorithm for the maximum clique problem

This page was built for publication: An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning