Author:
Liu Xiaoming,Yin Jianwei,Jwo Jung-Sing,Feng Zhilin,Dong Jinxiang
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation: Part II, graph coloring and number partitioning. Operations Research 39(3), 378–406 (1991)
2. Croitoru, C., Luchian, H., Gheorghies, O., Apetrei, A.: A New Genetic Graph Coloring Heuristic. In: COLOR 2002, Ithaca, NY (2002)
3. Amos, M., Gibbons, A.: Error-resistant Implementation of DNA Computations. In: Proceedings of the Second Annual Meeting on DNA Based Computers, vol. 44, pp. 151–168 (1996)
4. Bach, E., Condon, A., Glaser, E., Tanguay, C.: DNA models and algorithms for NP-complete problems. In: Proceedings of 11th Conference on Computational Complexity, pp. 290–299. IEEE Computer Society Press, Los Alamitos (1996)
5. Adleman, L.: Molecular computation of solution to combinatorial problems. Science, 266, 1021–1024 (1994)