{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T12:48:26Z","timestamp":1755694106943},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662450482"},{"type":"electronic","value":"9783662450499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45049-9_95","type":"book-chapter","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T10:07:14Z","timestamp":1411121234000},"page":"578-584","source":"Crossref","is-referenced-by-count":6,"title":["Accelerating Genetic Algorithm for Solving Graph Coloring Problem Based on CUDA Architecture"],"prefix":"10.1007","author":[{"given":"Kai","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ming","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"95_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., Werra, D.: Using Tabu Search Techniques for Graph Coloring. Computing\u00a039, 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"8","key":"95_CR2","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1016\/j.cor.2005.01.008","volume":"33","author":"C. Lucet","year":"2006","unstructured":"Lucet, C., Mendes, F., Moukrim, A.: An Exact Method for Graph Coloring. Computers and Operations Research\u00a033(8), 2189\u20132207 (2006)","journal-title":"Computers and Operations Research"},{"key":"95_CR3","doi-asserted-by":"crossref","unstructured":"Morgenstern, C.: Distributed Coloration Neighborhood Search. In: Cliques, Coloring and Satis-fiability \u2013 Second DIMACS Implementation Challenge 1993, vol.\u00a026, pp. 335\u2013358. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/16"},{"issue":"4","key":"95_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D.: New Methods to Color the Vertices of a Graph. Communications of the ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"key":"95_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"W.D. De","year":"1985","unstructured":"De, W.D.: An Introduction to Timetabling. European Journal of Operational Research\u00a019, 151\u2013162 (1985)","journal-title":"European Journal of Operational Research"},{"key":"95_CR6","doi-asserted-by":"crossref","unstructured":"Luebke, D., Santa, C.: CUDA Scalable Parallel Programming for High-Performance Scientific Computing. In: Proceedings of the 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, pp. 836\u2013838 (2008)","DOI":"10.1109\/ISBI.2008.4541126"},{"issue":"10","key":"95_CR7","first-page":"1","volume":"7","author":"F. Hermann","year":"2002","unstructured":"Hermann, F., Hertz, A.: Finding the Chromatic Number by Means of Critical Graphs. ACM Journal of Experimental Algorithms\u00a07(10), 1\u20139 (2002)","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"95_CR8","doi-asserted-by":"crossref","unstructured":"Shi, X., Lu, W., Wang, Z.: Programmable DNA Tile Self-assembly Using a Hierarchical Sub-tile Strategy. Nanotechnology\u00a025(7), 075602 (2014)","DOI":"10.1088\/0957-4484\/25\/7\/075602"},{"key":"95_CR9","doi-asserted-by":"crossref","unstructured":"Culberson, J., Luo, J.: Exploring the k-colorable Landscape with Iterated Greedy. Cliques. In: Coloring and Satisfiability - Second DIMACS Implementation Challenge, American Mathematical Society, vol. 26, pp. 245\u2013284 (1996)","DOI":"10.1090\/dimacs\/026\/13"},{"key":"95_CR10","doi-asserted-by":"crossref","unstructured":"Smith, K., Palaniswami, M.: Static and Dynamic Channel Assignment Using Neural Networks. IEEE J. Select. Areas Commun.\u00a015, C238\u2013C249 (1997)","DOI":"10.1109\/49.552073"},{"key":"95_CR11","doi-asserted-by":"crossref","unstructured":"Bianco, L., Caramia, M., Dell\u2019Olmo, M.: Solving a Preemptive Scheduling Problem Using Coloring Technique. In: Project Scheduling Recent Models, Algorithms and Applications. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4615-5533-9_6"},{"key":"95_CR12","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1002\/nav.1033","volume":"48","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., DellOlmo, M.: Iterative Coloring Extension of a Maximum Clique. Naval Research Logistics\u00a048, 518\u2013550 (2001)","journal-title":"Naval Research Logistics"},{"key":"95_CR13","unstructured":"Noise Reduction in VLSI Circuits using Modified GA Based Graph Coloring. International Journal of Control and Automation 3(2) (2010)"},{"key":"95_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.1998.0956","volume":"29","author":"S. Kannan","year":"1998","unstructured":"Kannan, S., Proebsting, T.: Register allocation in structured programs. Journal of Algorithms\u00a029, 223\u2013237 (1998)","journal-title":"Journal of Algorithms"},{"key":"95_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.dam.2006.07.012","volume":"156","author":"N. Thang","year":"2008","unstructured":"Thang, N., Bui, T.H., Nguyen, C.M.P., Kim-Anh, T.P.: An Ant-based Algorithm for Coloring Graphs. Discrete Applied Mathematics\u00a0156, 190\u2013200 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"95_CR16","unstructured":"White, T., Pagurek, B., Oppacher, F.: Improving the Ant System by Integration with Genetic Algorithms. In: Proceedings of the 3rd Conference on Genetic Programming, vol.\u00a07, pp. 610\u2013617 (1998)"}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing - Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45049-9_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T23:23:04Z","timestamp":1558999384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45049-9_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662450482","9783662450499"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45049-9_95","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}