Legends: |
Link to a Model |
Reference cited by multiple papers |

## References and models cited by this paper | ## References and models that cite this paper | |

Aarts E, Korst J (1989) Simulated annealing and Boltzmann machinesBallard DH, Gardner PC, Srinivas MA (1987) Graph problems and connectionist architectures Tech Rep No TR 167Bertoni A, Campadelli P, Grossi G (2002) A neural algorithm for the maximum clique problem: Analysis, experiments and circuit implementation Algorithmica 33:71-88Bhatia NP, Szego GP (1970) Stability theory of dynamical systemsBomze I (2005) Portfolio selection via replicator dynamics and projections of indefinite estimated covariances Dynamics of Continuous, Discrete and Impulsive Systems B 12:527-564Bomze IM (1986) Non-cooperative two-person games in biology: A classification Int J Game Theory 15:31-57Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem Handbook of combinatorial optimization (Suppl. Vol. A), Du DZ:Pardalos PM, ed. pp.1Bomze IM, Budinich M, Pelillo M, Rossi C (2002) Annealed replication: A new heuristic for the maximum clique problem Discr Appl Math 121:27-49Bomze IM, Pelillo M, Giacomini R (1997) Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale Developments in global optimization, Bomze IM:Csendes T:Horst R:Pardalos PM, ed. pp.95Bomze IR, Pelillo M, Stix V (2000) Approximating the maximum weight clique using replicator dynamics. IEEE Trans Neural Netw 11:1228-41 [Journal] [PubMed]Boppana R, Halldorsson MM (1992) Approximating maximum independent sets by excluding subgraphs BIT 32:180-196Brockington M, Culberson JC (1996) Camouflaging independent sets in quasi-random graphs Cliques, coloring and satisfiability: Second DIMACS implementation challenge, Johnson D:Trick M, ed. pp.75Busygin S, Butenko S, Pardalos PM (2002) A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere J Comb Optim 6:287-297Cabrales A, Sobel J (1992) On the limit points of discrete selection dynamics J Econom Theory 57:407-419Fisher RA (1930) The genetical theory of natural selectionFudenberg D, Levine DK (1998) The theory of learning in gamesFunabiki N, Takefuji Y, Lee KC (1992) A neural network model for finding a near-maximum clique J Parallel Distrib Comput 14:340-344Gaunersdorfer A, Hofbauer J (1995) Fictitious play, Shapley polygons, and the replicator equation Games Econom Behav 11:279-303Gibbons LE, Hearn DW, Pardalos PM, Ramana MV (1997) Continuous characterizations of the maximum clique problem Math Oper Res 22:754-768Godbeer GH, Lipscomb J, Luby M (1988) On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Tech Rep No 208-88Grossman T (1996) Applying the INN model the maximum clique problem Cliques, coloring and satisfiability: Second DIMACS Implementation Challenge, Johnson D:Trick M, ed. pp.122Grotschel M, Lovasz L, Schrijver A (1993) Geometric algorithms and combinatorial optimizationHastad J (1996) Clique is hard to approximate within n1- Proc 37th Ann Symp Found Comput Sci :627-636Hirsch MW, Smale S (1974) Differential Equations, Dynamical Systems and Linear AlgebraHofbauer J (1995) Imitation dynamics for games Unpublished manuscriptHofbauer J, Sigmund K (1998) Evolutionary games and population dynamicsHummel RA, Zucker SW (1983) On the foundations of relaxation labeling processes. IEEE Trans Pattern Anal Mach Intell 5:267-87 [PubMed]Jagota A (1995) Approximating maximum clique with a Hopfield neural network IEEE Trans Neural Networks 6:724-735Jagota A, Pelillo M, Rangarajan A (2000) A new deterministic annealing algorithm for maximum clique Proc IJCNN2000: Int J Conf Neural Networks :505-508Jagota A, Regan KW (1997) Performance of neural net heuristics for maximum clique on diverse highly compressible graphs J Global Optim 10:439-465Jagota 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, ed. pp.169Johnson D, Trick M (1996) Cliques, coloring and satisfiability: Second DIMACS Implementation ChallengeLin F, Lee K (1992) A parallel computation network for the maximum clique problem Proc 1st Int Conf Fuzzy Theory TechLuenberger DG (1984) Linear and nonlinear programmingMaynard_Smith J (1982) Evolution and the theory of gamesMiller DA, Zucker SW (1999) Efficient simplex-like methods for equilibria of nonsymmetric analog networks. Neural Comput 4:167-190Miller DA, Zucker SW (1999) Computing with self-excitatory cliques: A model and an application to hyperacuity-scale computation in visual cortex. Neural Comput 11:21-66 [PubMed]Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Turan Canad J Math 17:533-540Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexityPardalos PM, Rodgers GP (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming Computing 45:131-144Pekergin F, Morgul O, Guzelis C (1999) A saturated linear dynamical network for approximating maximum clique IEEE Trans Circuits And Syst 46:677-685Pelillo M (1995) Relaxation labeling networks for the maximum clique problem J Artif Neural Networks 2:313-328Pelillo M (1999) Replicator equations, maximal cliques, and graph isomorphism. Neural Comput 11:1933-55 [PubMed]Pelillo M (2002) Matching free trees, maximal cliques, and monotone game dynamics IEEE Trans Pattern Anal Machine Intell 24:1535-1541Pelillo M, Jagota A (1995) Feasible and infeasible maxima in a quadratic program for maximum clique J Artif Neural Networks 2:411-420Pelillo M, Siddiqi K, Zucker SW (1999) Matching hierarchical structures using association graphs IEEE Trans Pattern Anal Machine Intell 21:1105-1120Ramanujam J, Sadayappan P (1988) Optimization by neural networks Proc IEEE Int Conf Neural Networks :325-332Rosenfeld A, Hummel RA, Zucker SW (1976) Scene labeling by relaxation operations IEEE Trans Syst Man And Cybern 6:420-433Samuelson L (1997) Evolutionary games and equilibrium selectionShrivastava Y, Dasgupta S, Reddy S (1990) Neural network solutions to a graph theoretic problem Proc IEEE Int Symp Circuits Syst :2528-2531Shrivastava Y, Dasgupta S, Reddy SM (1992) Guaranteed convergence in a class of Hopfield networks. IEEE Trans Neural Netw 3:951-61 [Journal] [PubMed]Takefuji Y, Chen LL, Lee KC, Huffman J (1990) Parallel algorithms for finding a near-maximum independent set of a circle graph. IEEE Trans Neural Netw 1:263-7 [Journal] [PubMed]Wang RL, Tang Z, Cao QP (2003) An efficient approximation algorithm for finding a maximum clique using Hopfield network learning. Neural Comput 15:1605-19 [Journal] [PubMed]Weibull JW (1995) Evolutionary game theoryWu 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 :2248-2253 |