A neural network model for finding a near-maximum clique
- 1 March 1992
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 14 (3) , 340-344
- https://doi.org/10.1016/0743-7315(92)90072-u
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A parallel algorithm for allocation of spare cells on memory chipsIEEE Transactions on Reliability, 1991
- Artificial neural networks for four-coloring map problems and K-colorability problemsIEEE Transactions on Circuits and Systems, 1991
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- A parallel algorithm for tiling problemsIEEE Transactions on Neural Networks, 1990
- A global optimization approach for solving the maximum clique problemInternational Journal of Computer Mathematics, 1990
- A Near-Optimum Parallel Planarization AlgorithmScience, 1989
- Stereo correspondence through feature grouping and maximal cliquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Labeled point pattern matching by Delaunay triangulation and maximal cliquesPattern Recognition, 1986
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- A logical calculus of the ideas immanent in nervous activityBulletin of Mathematical Biology, 1943