Approximately solving Maximum Clique using neural network and related heuristics

Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan. Approximately solving Maximum Clique using neural network and related heuristics. In David S. Johnson, Michael A. Trick, editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 169-204, DIMACS/AMS, 1993.

Authors

Arun Jagota

This author has not been identified. Look up 'Arun Jagota' in Google

Laura A. Sanchis

This author has not been identified. Look up 'Laura A. Sanchis' in Google

Ravikanth Ganesan

This author has not been identified. Look up 'Ravikanth Ganesan' in Google