论文信息 - Some practical algorithms to solve the maximum clique problem - 字舞流文

Some practical algorithms to solve the maximum clique problem

[1] S. Prestwich. Local Search and Backtracking vs Non-Systematic Backtracking , 2001 .

[2] Panos M. Pardalos,et al. An Exact Parallel Algorithm for the Maximum Clique Problem , 1998 .

[3] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[4] Raymond E. Bonner,et al. On Some Clustering Techniques , 1964, IBM J. Res. Dev..

[5] M. Pelillo. Relaxation labeling networks for the maximum clique problem , 1996 .

[6] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.

[7] F. Brglez,et al. A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .