A parallelization of a heuristic for the maximum Clique problem

Authors:
Roberto Cruz;Nancy Lopez;Christian Trefftz
Affiliations:
Universidad de Antioquia, Medellín, Colombia, South-America;Institute of Cybernetics, Mathematics and Physics (ICIMAF), La Habana, Cuba;Grand Valley State University, Allendale, Michigan
Venue:
Journal of Computing Sciences in Colleges
Year:
2001

Citing 3
Cited 0

Neural network parallel computing

Neural network parallel computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating maximum clique with a Hopfield network

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Parallelization of a new Heuristic for the Maximum Clique Problem is described. The heuristic is based on neural networks. The parallelization was performed on a SMP machine using Fortran and Open MP directives. Reasonable speedups were obtained for a variety of test graphs. Further improvements to the heuristic were developed based on the initial parallel results.