An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

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

Neural Computation (2003) 15 (7): 1605–1619.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Do Not Let the Beginning Trap you! On Inhibition, Associative Creative Chains, and Hopfield Neural Networks

Ronald Mtenga
Mathias Bode
Radwa Khalil

The Journal of Creative Behavior (2025) 59 (2)

Reconstructing creative thoughts: Hopfield neural networks

Denisa Checiu
Mathias Bode
Radwa Khalil

Neurocomputing (2024) 575: 127324.

Predictability and forecasting automotive price based on a hybrid train algorithm of MLP neural network

M. Reza Peyghami
R. Khanduzi

Neural Computing and Applications (2012) 21 (1): 125.

A game–theoretic approach to partial clique enumeration

Samuel Rota Bulò
Andrea Torsello
Marcello Pelillo

Image and Vision Computing (2009) 27 (7): 911.

Payoff-Monotonic Game Dynamics and the Maximum Clique Problem

Marcello Pelillo
Andrea Torsello

Neural Computation (2006) 18 (5): 1215.

A Neural-based Algorithm for Topological Via-minimization Problem

Xinshun Xu
Zheng Tang
Ronglong Wang
Qiping Cao
Hiroki Tamura

IEEJ Transactions on Electronics, Information and Systems (2004) 124 (6): 1305.

OPTIMAL COMPETITIVE HOPFIELD NETWORK WITH STOCHASTIC DYNAMICS FOR MAXIMUM CUT PROBLEM

JIAHAI WANG
ZHENG TANG
QIPING CAO
RONGLONG WANG

International Journal of Neural Systems (2004) 14 (04): 257.