Aarts E, Korst J. (1989). Simulated annealing and Boltzmann machines.

Ballard DH, Gardner PC, Srinivas MA. (1987). Graph problems and connectionist architectures Tech Rep No TR 167.

Bertoni A, Campadelli P, Grossi G. (2002). A neural algorithm for the maximum clique problem: Analysis, experiments and circuit implementation Algorithmica. 33

Bhatia NP, Szego GP. (1970). Stability theory of dynamical systems.

Bomze I. (2005). Portfolio selection via replicator dynamics and projections of indefinite estimated covariances Dynamics of Continuous, Discrete and Impulsive Systems B. 12

Bomze IM. (1986). Non-cooperative two-person games in biology: A classification Int J Game Theory. 15

Bomze IM. (1997). Evolution towards the maximum clique J Global Optim. 10

Bomze IM. (1998). On standard quadratic optimization problems J Global Optim. 13

Bomze IM, Budinich M, Pelillo M, Rossi C. (2002). Annealed replication: A new heuristic for the maximum clique problem Discr Appl Math. 121

Bomze IM, Pelillo M, Giacomini R. (1997). Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale Developments in global optimization.

Bomze IR, Pelillo M, Stix V. (2000). Approximating the maximum weight clique using replicator dynamics. IEEE transactions on neural networks. 11 [PubMed]

Boppana R, Halldorsson MM. (1992). Approximating maximum independent sets by excluding subgraphs BIT. 32

Brockington M, Culberson JC. (1996). Camouflaging independent sets in quasi-random graphs Cliques, coloring and satisfiability: Second DIMACS implementation challenge.

Cabrales A, Sobel J. (1992). On the limit points of discrete selection dynamics J Econom Theory. 57

Fisher RA. (1930). The genetical theory of natural selection.

Fudenberg D, Levine DK. (1998). The theory of learning in games.

Funabiki N, Takefuji Y, Lee KC. (1992). A neural network model for finding a near-maximum clique J Parallel Distrib Comput. 14

Gaunersdorfer A, Hofbauer J. (1995). Fictitious play, Shapley polygons, and the replicator equation Games Econom Behav. 11

Gee AW, Prager RW. (1994). Polyhedral combinatorics and neural networks Neural Comput. 6

Grossman T. (1996). Applying the INN model the maximum clique problem Cliques, coloring and satisfiability: Second DIMACS Implementation Challenge.

Grotschel M, Lovasz L, Schrijver A. (1993). Geometric algorithms and combinatorial optimization.

Hastad J. (1996). Clique is hard to approximate within n1- Proc 37th Ann Symp Found Comput Sci.

Hirsch MW, Smale S. (1974). Differential Equations, Dynamical Systems and Linear Algebra.

Hofbauer J. (1995). Imitation dynamics for games Unpublished manuscript.

Hofbauer J, Sigmund K. (1998). Evolutionary games and population dynamics.

Hummel RA, Zucker SW. (1983). On the foundations of relaxation labeling processes. IEEE transactions on pattern analysis and machine intelligence. 5 [PubMed]

Jagota A. (1995). Approximating maximum clique with a Hopfield neural network IEEE Trans Neural Networks. 6

Jagota A, Pelillo M. (1995). Feasible and infeasible maxima in a quadratic program for maximum clique J Artif Neural Networks. 2

Jagota A, Pelillo M, Rangarajan A. (2000). A new deterministic annealing algorithm for maximum clique Proc IJCNN2000: Int J Conf Neural Networks.

Jagota A, Regan KW. (1997). Performance of neural net heuristics for maximum clique on diverse highly compressible graphs J Global Optim. 10

Jagota A, Sanchis L, Ganesan R. (1996). Approximately solving maximum clique using neural networks and related heuristics Cliques, coloring and satisfiability: Second DIMACS Implementation Challenge.

Johnson D, Trick M. (1996). Cliques, coloring and satisfiability: Second DIMACS Implementation Challenge.

Lin F, Lee K. (1992). A parallel computation network for the maximum clique problem Proc 1st Int Conf Fuzzy Theory Tech.

Luby M, Godbeer GH, Lipscomb J. (1988). On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Tech Rep No 208-88.

Luenberger DG. (1984). Linear and nonlinear programming.

Maynard_Smith J. (1982). Evolution and the theory of games.

Miller DA, Zucker SW. (1999). Computing with self-excitatory cliques: A model and an application to hyperacuity-scale computation in visual cortex. Neural computation. 11 [PubMed]

Miller DA, Zucker SW. (1999). Efficient simplex-like methods for equilibria of nonsymmetric analog networks. Neural Comput. 4

Motzkin TS, Straus EG. (1965). Maxima for graphs and a new proof of a theorem of Turan Canad J Math. 17

Papadimitriou CH, Steiglitz K. (1982). Combinatorial optimization: Algorithms and complexity.

Pardalos PM, Bomze IM, Budinich M, Pelillo M. (1999). The maximum clique problem Handbook of combinatorial optimization (Suppl. Vol. A).

Pardalos PM, Busygin S, Butenko S. (2002). A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere J Comb Optim. 6

Pardalos PM, Gibbons LE, Hearn DW, Ramana MV. (1997). Continuous characterizations of the maximum clique problem Math Oper Res. 22

Pardalos PM, Rodgers GP. (1990). Computational aspects of a branch and bound algorithm for quadratic zero-one programming Computing. 45

Pekergin F, Morgul O, Guzelis C. (1999). A saturated linear dynamical network for approximating maximum clique IEEE Trans Circuits And Syst. 46

Pelillo M. (1995). Relaxation labeling networks for the maximum clique problem J Artif Neural Networks. 2

Pelillo M. (1999). Replicator equations, maximal cliques, and graph isomorphism. Neural computation. 11 [PubMed]

Pelillo M. (2002). Matching free trees, maximal cliques, and monotone game dynamics IEEE Trans Pattern Anal Machine Intell. 24

Ramanujam J, Sadayappan P. (1988). Optimization by neural networks Proc IEEE Int Conf Neural Networks.

Samuelson L. (1997). Evolutionary games and equilibrium selection.

Shrivastava Y, Dasgupta S, Reddy S. (1990). Neural network solutions to a graph theoretic problem Proc IEEE Int Symp Circuits Syst.

Shrivastava Y, Dasgupta S, Reddy SM. (1992). Guaranteed convergence in a class of Hopfield networks. IEEE transactions on neural networks. 3 [PubMed]

Takefuji Y, Chen LL, Lee KC, Huffman J. (1990). Parallel algorithms for finding a near-maximum independent set of a circle graph. IEEE transactions on neural networks. 1 [PubMed]

Wang RL, Tang Z, Cao QP. (2003). An efficient approximation algorithm for finding a maximum clique using Hopfield network learning. Neural computation. 15 [PubMed]

Weibull JW. (1995). Evolutionary game theory.

Wu J, Harada T, Fukao T. (1994). New method to the solution of maximum clique problem: Mean-field approximation algorithm and its experimentation Proc IEEE Int Conf Syst, Man, Cybern.

Zucker SW, Pelillo M, Siddiqi K. (1999). Matching hierarchical structures using association graphs IEEE Trans Pattern Anal Machine Intell. 21

Zucker SW, Rosenfeld A, Hummel RA. (1976). Scene labeling by relaxation operations IEEE Trans Syst Man And Cybern. 6