An efficient approximation algorithm for finding a maximum clique using Hopfield network learning

Neural Computation

Volumn 15, Issue 7, 2003, Pages 1605-1619

  Wang, Rong Long ^a   Tang, Zheng ^a   Cao, Qi Ping ^b  

^a UNIVERSITY OF TOYAMA   (Japan)

^b Tateyama Systems Institute   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; LEARNING; PHYSIOLOGY;

ALGORITHMS; LEARNING; NEURAL NETWORKS (COMPUTER);

EID: 0037484717     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976603321891828     Document Type: Article

References (21)

1. Balas, E., & Yu, C. S. (1986). Finding a maximum clique in an arbitrary graph. SIAM J. Comput., 15, 1054-1068.
2. Carraghan, R., & Pardalos, P. M. (1990). An exact algorithm for the maximum clique problem. Oper. Res. Lett., 9, 375-382.
3. Feiges, U., Goldwasser, S., Safra, S., Lovasz, L., & Szegedy, M. (1991). Approximating clique is almost NP-complete. In Proc. 32nd Annual IEEE Symposium on the Foundations of Computer Science (pp. 2-12). Los Angeles: IEEE Computer Society.
4. Funabiki, N., & Nishikawa, S. (1996). Comparisons of energy-descent optimization algorithms for maximum clique problems. Trans. IEICE, E79-A, pp. 452-460.
5. 1-ε. In Proc. 37th Annual IEEE Symposium on the Foundations of Computer Science (pp. 627-636). Los Angeles: IEEE Computer Society.
6. Hopfield, J. J. (1982). Neurons with graded response have collective computation properties like those of two-state neurons. Proc. Nat. Acad. Sci. U.S.A., 81, 3088-3092.
7. Hopfield, J. J., & Tank, D. W. (1985). "Neural" computation of decisions in optimization problems. Bio. Cybern., 52, 141-152.
8. Jagota, A. (1995). Approximating maximum clique with a Hopfield network. IEEE Trans. Neural Networks, 6, 724-735.
9. Johnson, D. S. (1974). Approximation algorithms for combinatorial problem. J. Comput. Syst. Sci., 9, 256-278.
10. Johnson, D., & Trick, M. (Eds.). (1996). Cliques, coloring, and satisfiability. New York: American Mathematical Society.
11. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & I. M. Thatcher (Eds.), Complexity of computer computations (pp. 85-103). New York: Plenum Press.
12. Lagarias, J. C., & Shor, P. W. (1992). Keller's cube-tiling conjecture is false in high dimensions. Bulletin AMS, 27, 279-283.
13. Lecky, J. E., Murphy, O. J., & Absher, R. G. (1989). Graph theoretic algorithms for the PLA folding problem. IEEE Trans. Computer-Aided Design, 8, 1014-1021.
14. Marchiori, E. (1998). A simple heuristic based genetic algorithm for the maximum clique problem. In Proc. ACM Symp. Appl. Comput. (pp. 366-373). New York: American Mathematical Society.
15. Pardalos, P. M., & Phillips, A. T. (1990). A global optimization approach for solving the maximum clique problem. Int. J. Comp. Math., 33, 209-216.
16. Pardalos, P. M., & Rodgers, G. P. (1992). A branch and bound algorithm for the maximum clique problem. Comp. Oper. Res., 19, 363-375.
17. Pardalos, P. M., & Xue, J. (1994). The maximum clique problem. Journal of Global Optimization, 4, 301-328.
18. Sloane, N. J. A. (1989). Unsolved problem in graph theory arising from the study of codes. J. Graph Theory Notes of New York, 18, 11-20.
19. Soule, T., & Foster, J. A. (1995). Using genetic algorthms to find maximum cliques (Tech. Rep. No. LAL 95-12). Moscow: Department of Computer Science, University of Idaho.
20. Tomita, E., & Fujii, T. (1985). Efficient algorithms for finding a maximum clique and their experimental evaluation. Trans. IEICE, J68-D, 221-228.
21. Yamada, Y., Tomita, E., & Takahashi, H. (1993). A randomized algorithm for finding a near-maximum clique and its experimental evaluations. Trans. IEICE, J76-D-I, 46-53.