Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

An efficient approximation algorithm for finding a maximum clique using Hopfield network learning.

Rong Long Wang1, Zheng Tang, Qi Ping Cao

  • 1Faculty of Engineering, Toyama University, Toyama-shi, Japan 930-8555. wangrl@hi.iis.toyama-u.ac.jp

Neural Computation
|June 21, 2003
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Hydroxyl-rich nanocavities on perovskite enable nearly barrierless intramolecular hydrogen transfer for nitrate electroreduction to ammonia.

Nature communications·2026
Same author

A Biomimetic Visual Sensing Framework: Unsupervised Orientation Topographic Mapping via Self-Organizing Neural Networks.

Biomimetics (Basel, Switzerland)·2026
Same author

A g-C<sub>3</sub>N<sub>4</sub>-stabilized Au nanozyme-based sensor with AI-powered "recognition-extraction-interpretation-report" for bias-minimized in-field monitoring of mercury ions.

The Analyst·2026
Same author

Trifunctional electrocatalyst with accurate surface reconstruction for zinc-air batteries and water electrolyzers.

Nature communications·2026
Same author

Rational design of a o-phosphoethanolamine-functionalized sheet-like nanozyme enables target-induced crosslinking for sensing Cr<sup>3</sup>.

Analytica chimica acta·2026
Same author

Breaking the Cryogenic Sensing Limitation: Solvent-Microenvironment-Programmed Cold-Adaptable Nanozymes Enable Sensitive Volatile Amine Detection at Low Temperature.

Analytical chemistry·2026
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

This study introduces a novel Hopfield neural network algorithm for solving the maximum clique problem. The gradient-ascent approach enhances parallel processing for efficient, near-optimum solutions.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Graph Theory

Background:

  • The maximum clique problem is a fundamental challenge in graph theory with significant computational complexity.
  • Existing algorithms often struggle with scalability and finding optimal solutions efficiently.

Purpose of the Study:

  • To propose a novel parallel algorithm for the maximum clique problem using a Hopfield neural network.
  • To enhance the network's ability to find a true maximum clique beyond near-maximum solutions.

Main Methods:

  • Utilizing a gradient-ascent learning algorithm within a Hopfield neural network framework.
  • Implementing weight modifications to guide the network from near-maximum to optimal clique states.
  • Testing the algorithm on random and benchmark graph datasets (DIMACS).

Related Experiment Videos

Main Results:

  • The proposed algorithm demonstrates effectiveness in finding near-optimum solutions for the maximum clique problem.
  • The gradient-ascent method successfully enables the network to escape local optima.
  • The parallel approach achieves good solutions within reasonable computation times.

Conclusions:

  • The developed Hopfield neural network algorithm offers a promising parallel approach to the maximum clique problem.
  • This method provides a viable strategy for efficiently identifying maximum cliques in complex graphs.
  • The algorithm's performance on benchmark datasets validates its practical applicability.