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

Cite

Text

Wang et al. "An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning." Neural Computation, 2003. doi:10.1162/089976603321891828

Markdown

[Wang et al. "An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning." Neural Computation, 2003.](https://mlanthology.org/neco/2003/wang2003neco-efficient/) doi:10.1162/089976603321891828

BibTeX

@article{wang2003neco-efficient,
  title     = {{An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning}},
  author    = {Wang, Rong Long and Tang, Zheng and Cao, Qi Ping},
  journal   = {Neural Computation},
  year      = {2003},
  pages     = {1605-1619},
  doi       = {10.1162/089976603321891828},
  volume    = {15},
  url       = {https://mlanthology.org/neco/2003/wang2003neco-efficient/}
}