{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:03Z","timestamp":1725493623508},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660507"},{"type":"electronic","value":"9783540487746"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48774-3_4","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:10:57Z","timestamp":1184598657000},"page":"30-39","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Graph Coloring by Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Nicole","family":"Drechsler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"G\u00fcnther","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1038\/sj\/jors\/0411109","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069\u20131072, 1990.","journal-title":"Journal of the Operational Research Society"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz. New methods to color vertices of a graph. Comm. of the ACM, 22:251\u2013256, 1979.","journal-title":"Comm. of the ACM"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"S. Chiusano, F. Corno, P. Prinetto, and M. Sonza Reorda. Hybrid symbolic-explicit techniques for the graph coloring problem. In European Design & Test Conf, pages 422\u2013426, 1997.","DOI":"10.1109\/EDTC.1997.582394"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"O. Coudert. Exact coloring of real-life graphs is easy. In Design Automation Conf., pages 121\u2013126, 1997.","DOI":"10.1145\/266021.266047"},{"key":"4_CR5","series-title":"Technical Report","volume-title":"Iterated greedy graph coloring and the difficult landscape","author":"J.C. Culberson","year":"1992","unstructured":"J.C. Culberson. Iterated greedy graph coloring and the difficult landscape. Technical Report TR92-07, University of Alberta, Department of Computing Science, Edmonton, Alberta, Canada, 1992. ftp:\/\/ftp.ualberta.ca\/pub\/TechReport ."},{"key":"4_CR6","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"L. Davis. Handbook of Genetic Algorithms. van Nostrand Reinhold, New York, 1991."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"R. Drechsler. Evolutionary Algorithms for VLSI CAD. Kluwer Academic Publisher, 1998.","DOI":"10.1007\/978-1-4757-2866-8"},{"key":"4_CR8","series-title":"Technical Report","volume-title":"Graph coloring with adaptive genetic algorithms","author":"A.E. Eiben","year":"1996","unstructured":"A.E. Eiben and J.K. van der Hauw. Graph coloring with adaptive genetic algorithms. Technical Report 11\/96, Leiden University, Leiden, Netherlands, 1996."},{"key":"4_CR9","unstructured":"C. Fleurent and J.A. Ferland. Annals of Operations Research. Genetic and Hybrid Algorithms for Graph Coloring. edited by G. Laporte, I. H. Osman, and P. L. Hammer, 1994."},{"key":"4_CR10","volume-title":"Computers and Intractability-A Guide to NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability-A Guide to NP-Completeness. Freemann, San Francisco, 1979."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"T. Sasao. Logic Synthesis and Optimization. Kluwer Academic Publisher, 1993.","DOI":"10.1007\/978-1-4615-3154-8"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"C. Scholl, S. Melchior, G. Hotz, and P. Molitor. Minimizing ROBDD sizes of incompletely specified functions by exploiting strong symmetries. In European Design & Test Conf., pages 229\u2013234, 1997.","DOI":"10.1109\/EDTC.1997.582364"},{"key":"4_CR13","unstructured":"W. Wan and M.A. Perkowski. A new approach to the decomposition of imcompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping. In European Design Automation Conf, pages 230\u2013235, 1992."}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48774-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:34:41Z","timestamp":1556670881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48774-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660507","9783540487746"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48774-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}