{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:37:37Z","timestamp":1725565057330},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221142"},{"type":"electronic","value":"9783540246855"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24685-5_27","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T17:18:16Z","timestamp":1283966296000},"page":"215-222","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Genetic Algorithm for Graph Coloring Problem"],"prefix":"10.1007","author":[{"given":"Zbigniew","family":"Kokosi\u0144ski","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Ko\u0142odziej","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Kwarciany","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"27_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/TEVC.2002.800880","volume":"6","author":"E. Alba","year":"2002","unstructured":"Alba, E., Tomasini, M.: Parallelism and evolutionary algorithms. IEEE Trans. Evol. Comput.\u00a06(5), 443\u2013462 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T.: Evolutionary algorithms in theory and practice. Oxford U. Press (1996)","key":"27_CR2","DOI":"10.1093\/oso\/9780195099713.003.0007"},{"unstructured":"Croitoriu, C., Luchian, H., Gheorghies, O., Apetrei, A.: A new genetic graph coloring heuristic. In: Computational Symposium on Graph Coloring and Generalizations COLOR 2002, [in:] Proc. Int. Conf. Constraint Programming CP 2002 (2002)","key":"27_CR3"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/BFb0056916","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.-K.: A new genetic local search algorithm for graph coloring. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 745\u2013754. Springer, Heidelberg (1998)"},{"unstructured":"Galinier, P., Hao, J.-K.: Hybrid evolutionary algorithms for graph coloring. J. Combinatorial Optimization, 374\u2013397 (1999)","key":"27_CR5"},{"key":"27_CR6","volume-title":"Graph coloring problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph coloring problems. Wiley Interscience, Hoboken (1995)"},{"doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, coloring and satisfiability: 2nd DIMACS Impl. Challenge. DIMACS Series in Discr. Math. and Theor. Comp. Sc., vol.\u00a026 (1996)","key":"27_CR7","DOI":"10.1090\/dimacs\/026"},{"doi-asserted-by":"crossref","unstructured":"Khuri, S., Walters, T., Sugono, Y.: Grouping genetic algorithm for coloring edges of graph. In: Proc. 2000 ACM Symposium on Applied Computing, pp. 422\u2013427 (2000)","key":"27_CR8","DOI":"10.1145\/335603.335880"},{"unstructured":"Kubale, M.: Introduction to computational complexity and algorithmic graph coloring, GTN, Gda\u0144sk (1998)","key":"27_CR9"},{"unstructured":"Kubale, M. (ed.): Discrete optimization. Models and methods for graph coloring, WNT, Warszawa (2002) (in Polish)","key":"27_CR10"},{"unstructured":"http:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html","key":"27_CR11"},{"unstructured":"ftp:\/\/dimacs.rutgers.edu\/pub\/challenge\/graph\/benchmarks\/","key":"27_CR12"},{"unstructured":"http:\/\/mat.gsia.cmu.edu\/COLORING03\/","key":"27_CR13"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24685-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:56:32Z","timestamp":1636419392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24685-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221142","9783540246855"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24685-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}