Comparisons of energy-descent optimization algorithms for maximum clique problems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 4, 1996, Pages 452-459

  Funabiki, Nobuo ^a   Nishikawa, Seishi ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Algorithm; Energy descent optimization; Maximum clique; Neural network; Np complete

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; NEURAL NETWORKS; OPTIMIZATION; PERFORMANCE;

ENERGY DESCENT OPTIMIZATION ALGORITHM; MAXIMUM CLIQUE; RANDOM GRAPH;

ALGORITHMS;

EID: 0030125301     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. M. R. Garey and D.S. JohnsonComputers and intractability Freeman, San Francisco, 1979.
2. U. Feige, S. Goldwasser, L. Lovåsz, S. Safra, and M. SzegedyApproximating cliques is almost NPcomplete Proc. 32nd Ann. IEEE Symp. Found. Comp. Sci., pp. 2-12, 1991.
3. P. Crescenzi, C. Fiorini, and R. SilvestriA note on the approximation of the MAX CLIQUE problem Inform. Proc. Lett., vol.40, no. 1, pp. 1-5, 1991.
4. E. Balas and C. S. YuFinding a maximum clique in an arbitrary graph SIAM J. Comput., vol. 15, no. 4, pp. 1054-1068, Nov. 1986.
5. H. OgawaLabeled point pattern matching by Delaunay triangulation and maximal cliques Pattern Recognition, vol. 19, no. 1, pp. 35-40, 1986.
6. J. E. Lecky, O. J. Murphy, and R. G. AbsherGraph theoretic algorithms for the PLA folding problem IEEE Trans. Computer-Aided Design, vol.8, no. 9, pp. 1014-1021, Sept. 1989.
7. R. Horaud and T. SkordasStereo correspondence through feature grouping and maximal cliques IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 11, pp. 1168-1180, Nov. 1989.
8. E. Tomita and T. FujiiEfficient algorithms for finding a maximum clique and their experimental evaluation Trans. IECE, vol. J68-D, no. 3, pp. 221-228, 1985.
9. R. Carraghan and P. M. PardalosAn exact algorithm for the maximum clique problem Oper. Res. Lett., 9, pp. 375-382, 1990.
10. P. M. Pardalos and A. T. PhillipsA global optimization approach for solving the maximum clique problem Int. J. Comp. Math., vol. 33, pp. 209-216, 1990.
11. P. M. Pardalos and G. P. RodgersA branch and bound algorithm for the maximum clique problem Comp. Oper. Res., vol. 19. no. 5, pp. 363-375, 1992.
12. L. BabelFinding maximum cliques in arbitrary and in special graphs Computing, vol.46, pp. 321-341, 1991.
13. D.S. JohnsonApproximation algorithms for combinatorial problems J. Comput. Syst. Sci., vol. 9, pp. 256-278, 1974.
14. E. Tomita, H. Takahashi, and S. MitsumaA polynomial-time algorithm for finding a near-maximum clique and its experimental evaluation Trans. IEICE, vol. J74-D-I, no. 4, pp. 307-310, April 1991.
15. Y. Yamada, E. Tomita, and H. TakahashiA randomized algorithm for finding a near-maximum clique and its experimental evaluations Trans. IEICE, vol. J76-D-I, no. 2, pp. 46-53, Feb. 1993.
16. M. Gendreau, P. Soriano, and L. SalvailSolving the maximum clique problem using a tabu search approach Ann. Oper. Research, vol.41, pp. 385-403, 1993.
17. A. JagotaApproximating maximum clique with a Hopfield network IEEE Trans. Neural Networks, vol. 6, no. 3, pp. 724-735, May 1995.
18. W. S. McCulloch and W. H. PittsA logical calculus of the ideas immanent in nervous activity Bulletin of Mathematical Biophysics, 5, pp. 115-133, 1943.
19. J. J. Hopfield and D.W. TankNeural computation of decisions in optimization problems Biological Cybernetics, vol.52, pp. 141-152, 1985.
20. H. Yamashita, T. Kurokawa, and Y. KogaHardware implementation of a binary neural network system Trans. IEICE, vol. J77-D-II, no. 10, pp. 2130-2137, Oct. 1994.
21. Y. TakefujiNeural network parallel computing Kluwer Academic Publishers, 1992.
22. N. Funabiki and Y. TakefujiA neural network parallel algorithm for channel assignment problems in cellular radio networks IEEE Trans. Vehi. Tech., vol.41, no. 4, pp. 430-437, Nov. 1992.
23. N. Funabiki and Y. TakefujiA parallel algorithm for channel routing problems IEEE Trans. Computer-Aided-Design, vol. 11, no. 4, pp. 464-474, April 1992.
24. N. Funabiki and Y. TakefujiA neural network approach to topological via minimization problems IEEE Trans. Computer-Aided-Design, vol. 12, no. 6, pp. 770-779, June 1993.
25. N. Funabiki and S. NishikawaAn improved neural network for channel assignment problems in cellular mobile communication systems IEICE Trans. Commun., vol. E78-B, no. 8, pp. 1187-1196, Aug. 1995.