1ADLEMAN L M.Molecular computation of solutions to combinatorial problems[J].Science,1994,226(11):1021-1024.
2CARTER B,PARK K.How good are genetic algorithms at finding large cliques:an experimental study,Technical Report Bu-CS-93-015[R].Boston:Computer Science Dept.,Boston University,1993.
3BALLARD D H,GARDNER P C,SRINIVAS M A.Graph problems and connectionist architectures,Technical Report TR 167[R].New York:Dept Computer Science,University of Rochester,1987.
4AARTS E,KORST J.Simulated annealing and boltzmann machines,a stochastic approach to combinational optimization and neural computing[M].New York:Wiley,1989.
5FRIDEN C,HERTZ A,DeWERRA D.Stabulus:a technique for finding stable sets in large graphs with tabu search[J].Computing,1989,42(1):35-44.
6PARDALOS P M,PHILLIPS A T.A global optimization approach for solving the maximum clique problem[J].International Journal of Computer Mathematics,1990,33:209-216.
7MARCHIORI E.A simple heuristic based genetic algorithm for the maximum clique problem:proc.of the ACM Symposium on Applied Computing[C].New York:ACM Press,1998:366-373.
8BATTITI R,PROSTASI M.Reactive local search for the maximum clique problem[J].Algorithmica,2001,29(4):610-637.
9PULLAN W,HOOS H H.Dynamic local search for the maximum clique problem[J].Journal of Artificial Intelligence Research,2006,25:159-185.
10JOHNSON D,TRICK M.Cliques,coloring and satisfiability:second DIMACS implementation challenge[J].DIMACS Series in Discrete Mathematics and Theoretical Computer Science,1996,26:533-558.
