A saturated linear dynamical network for approximating maximum clique

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 46, Issue 6, 1999, Pages 677-685

  Pekergin, Ferhan ^a   Morgiil, Orner ^b   Güzeli, Cüneyt ^c  

^a Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

^b BILKENT UNIVERSITY   (Turkey)

^c ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Combinatorial optimization; Gradient systems; Max clique; Neural networks

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

MAXIMUM CLIQUE PROBLEM; SATURATED LINEAR GRADIENT DYNAMICAL NETWORK;

NEURAL NETWORKS;

EID: 0032661372     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.768824     Document Type: Article

References (10)

1. M. W. Hirsch and S. Smale, Differential Equations, Dynamical Systems, and Linear Algebra. San Diego, ÇA: Academic, 1974.
2. A. Cichocki and R. Unbehauben, Neural Networks for Optimization and Signal Processing. New York: Wiley, 1993.
3. J.-H. Li, A. N. Michel, and W. Porod, "Analysis and synthesis of a class of neural networks: Linear systems operating on a closed hypercube," IEEE Trans. Circuits Syst., vol. 36, pp. 1405-1422, Nov. 1989.
4. P. M. Pardalos and F. B. Rosen, "Constrained global optimization: Algorithms and applications," in Lecture Notes in Computer Science. Berlin: Springer-Verlag 1987.
5. M. R. Garey and S. J. Johnson, Computers and Intractability: A Guide to the Theory ofNP-Completeness. San Francisco, CA: Freeman 1993.
6. U. Feige, S. Goldwasser, L. Lovâsz, S. Safra, and M. Szegedy, "Ap-proximating clique is almost NP-complete," in Proc. 32nd Ann. Symp. Found. Computer Science, San Juan, Puerto Rico, 1991, pp. 2-12.
7. P. Pardalos and J. Xue, "The maximum clique problem," J. Global Optimization, vol. 4, pp. 301-328, 1994.
8. A. Jagota, "Approximating maximum clique with a Hopfield network," IEEE Trans. Neural Networks, vol. 6, pp. 724-735, May 1995.
9. M. Pelillo, "Relaxation labeling networks for the maximum clique problem," J. Artificial Neural Networks, vol. 2, no. 4, pp. 313-328, 1995.
10. P. M. Pardalos and G. P. Rodgers, "A branch and bound algorithm for the maximum clique problem," Computers Ops. Res., vol. 19, no. 5, pp. 363-375, 1992.