๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Maximum neural network with nonlinear self-feedback for maximum clique problem

โœ Scribed by Jiahai Wang; Zheng Tang; Ronglong Wang


Book ID
113813651
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
318 KB
Volume
57
Category
Article
ISSN
0925-2312

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A neural network model for finding a nea
โœ Nubuo Funabiki; Yoshiyasu Takefuji; Kuo-Chun Lee ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB

A parallel algorithm based on the neural network model for finding a near-maximum clique is presented in this paper. A maximum clique of a graph G is a maximum complete subgraph of G where any two vertices are adjacent. The problem of finding a maximum clique is NP-complete. The parallel algorithm r