Approximating Maximum Clique with a Hopfield Network

IEEE Transactions on Neural Networks

Volumn 6, Issue 3, 1995, Pages 724-735

  Jagota, Arun ^a  

^a Department of Mathematical Sciences Memnhis State University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; HEURISTIC METHODS; OPTIMIZATION; SIMULATED ANNEALING;

ENERGY DESCENT OPTIMIZING DYNAMICS; GREEDY ALGORITHMS; HOPFIELD NETWORK; MAXIMUM CLIQUE; MEAN FIELD ANNEALING;

NEURAL NETWORKS;

EID: 0029304809     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.377977     Document Type: Article

References (38)

1. S. V. B. Aiyer, M. Niranjan, and F. Fallside, “A theoretical investigation into the performance of the Hopfield model,” IEEE Trans. Neural Networks, vol. 1, no. 2, pp. 204-215, 1990.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, “Proof verification and hardness of approximation problems,” in Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, pp. 14-23.
3. G. Augustson and J. Minker, “An analysis of some graph-theoretical clustering techniques,” J. Assoc. Comput. Machinery, vol. 17, no. 4, pp. 571-588, Oct. 1970.
4. E. Balas and C. S. Yu, “Finding a maximum clique in an arbitrary graph,” SIAM J. Comput., vol. 15, no. 4, Nov. 1986.
5. D. H. Ballard, P. C. Gardner, and M. A. Srinivas, “Graph problems and connectionist architectures,” Dep. Comput. Sci., Univ. Rochester, Tech. Rep., 1987.
6. G. Bilbro, R. Mann, T. K. Miller, W. E. Snyder, D. E. Van den Bout, and M. White, “Optimization by mean field annealing,” in Advances in Neural Information Processing Systems, D. S. Touretzky, Ed. San Mateo, CA: Morgan-Kaufmann, vol. 1, pp. 91-98, 1989.
7. B. Bollobas and P. Erdos, “Cliques in random graphs,” Proc. Camb. Phil. Soc., vol. 80, pp. 419-427, 1976.
8. P. Crescenzi, C. Fiorini, and R. Silvestri, “A note on the approximation of the maxclique problem,” Inf. Proc. Lett., vol. 40, no. 1, pp. 1-5, Oct. 1991.
9. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
10. U. Freige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy, “Approximating clique is almost NP-complete,” in Proc. Symp. Found. Comput. Sci., 1991, pp. 2-12.
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
12. G. H. Godbeer, J. Lipscomb, and M. Luby, “On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets),” Dep. Comput. Sci., Univ. Toronto, Tech. Rep., 1988.
13. J. R. Griggs, “Lower bounds on the independence number in terms of the degrees,” J. Combinatorial Theory, Series B, vol. 34, pp. 22-39, 1983.
14. T. Grossman and A. Jagota, “On the equivalence of two Hopfield-type networks,” in Proc. IEEE Int. Conf. Neural Networks, 1993, pp. 1063-1068.
15. J. Hertz, A. Krogh, and R. G. Palmer, Introduction to the Theory of Neural Computation. Reading, MA: Addison-Wesley, 1991.
16. J. J. Hopfield. “Neural networks and physical systems with emergent collective computational abilities,” in Proc. Nat. Academy Sci., USA, vol. 79, 1982.
17. J. J. Hopfield, “Neurons with graded responses have collective computational properties like those of two-state neurons,” in Proc. Nat. Academy Sci., USA, vol. 81, 1984.
18. R. Horaud and T. Skordas, “Stereo correspondence through feature grouping and maximal cliques,” IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 11, pp. 1168-1180, 1989.
19. A. Jagota, “Applying a Hopfield-style network to degraded text recognition,” in Proc. Int. Joint Conf. Neural Networks, New York, vol. 1, 1990.
20. A. Jagota, “A new Hopfield-style network for content-addressable memories,” Department of Computer Science, SUNY at Buffalo, Tech. Rep. 90-02, 1990.
21. A. Jagota, “Efficiently approximating Max-Clique in a Hopfield-style network,” in Proc. Int. Joint Conf. Neural Networks, vol. 2, pp. 248-253, New York, June 1992.
22. A. Jagota, “A Hopfield-style network with a graph-theoretic characterization,” J. Artificial Neural Networks, vol. 1, no. 1, 145-167, 1994.
23. A. Jagota, “Optimization by reduction to maximum clique,” in Proc. IEEE Int. Confe. Neural Networks, New York, Mar. 1993, pp. 1526-1531.
24. A. Jagota and K. W. Regan, “Performance of max-clique heuristics under description-length weighted distributions,” Dep. Comput. Sci., SUNY at Buffalo, Tech. Rep. 92-24, Sept. 1992, available from author.
25. M. Jerrum, “The elusiveness of large cliques in a random graph,” Dep. Comput. Sci., University of Edinburgh, Tech. Rep. CSR-9-90, Sept. 1990.
26. Y. Kamp and M. Hasler, Recursive Neural Networks for Associative Memory. New York: Wiley, 1990.
27. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum Press, 1972, pp. 1-19.
28. R. M. Karp, “The probabilistic analysis of some combinatorial search algorithms,” in Algorithms and Complexity: New Directions and Recent Results, J. F. Traub, Ed. New York: Academic, 1976, pp. 1-19.
29. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, 220, 1983.
30. J. E. Lecky, O. J. Murphy, and R. G. Absher, “Graph theoretic algorithms for the pla folding problem,” IEEE Trans. Comput. Aided Design, vol. 8, no. 9, pp. 1014-1021, 1989.
31. F. Lin and K. Lee, “A parallel computation network for the maximum clique problem,” in Proc. 1st Int. Conf Fuzzy Theory Tech., Oct. 1992.
32. A. K. Mackworth, “Constraint satisfaction,” in Encyclopedia of Artificial Intelligence, 2nd ed. S. C. Shapiro, Ed. New York: Wiley, 1992, pp. 285-290.
33. H. Ogawa, “Labeled point pattern matching by delaunay triangulation and maximal cliques,” Pattern Recognition, vol. 19, no. 1, pp. 35-40, 1986.
34. E. M. Palmer, Graphical Evolution. New York: Wiley, 1985, p. 76).
35. C. Peterson and B. Soderberg, “A new method for mapping optimization problems onto neural networks,” Int. J. Neural Syst., vol. 1, pp. 3-22, 1989.
36. J. Ramanujam and P. Sadayappan, “Optimization by neural networks,” in Proc. Int. Conf. Neural Networks, New York, vol. 2, 1988, pp. 325-332.
37. I. Shariv, T. Grossman, E. Domany, and A. A. Friesem, “All-optical implementation of the inverted neural network model,” Opt. Complex Syst., vol. 1319, 1990.
38. Y. Shrivastava, S. Dasgupta, and S. M. Reddy, “Neural network solutions to a graph theoretic problem,” in Proc. IEEE Int. Symp. Circuits Syst., IEEE, New York, 1990, pp. 2528-2531.