{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:55:06Z","timestamp":1743108906718,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_37","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"365-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Experimental Comparison of Heuristic Coloring Algorithms in Terms of Found Color Classes on Random Graphs"],"prefix":"10.1007","author":[{"given":"Deniss","family":"Kumlander","sequence":"first","affiliation":[]},{"given":"Aleksei","family":"Kulit\u0161kov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/352","volume-title":"Graph Colorings","author":"M Kubale","year":"2004","unstructured":"Kubale, M.: Graph Colorings. American Mathematical Society, US (2004)"},{"key":"37_CR2","volume-title":"Some practical algorithms to solve the maximum clique problem","author":"D Kumlander","year":"2005","unstructured":"Kumlander, D.: Some practical algorithms to solve the maximum clique problem. Tallinn University of Technology, Tallinn (2005)"},{"issue":"1","key":"37_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1), 85\u201386 (1967)","journal-title":"Comput. J."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Hasenplaugh, W., Kaler, T., Schardl, T.B., Leiserson, C.E.: Ordering heuristics for parallel graph coloring. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures\u2013SPAA\u201914, pp. 166\u2013177 (2014)","DOI":"10.1145\/2612669.2612697"},{"issue":"4","key":"37_CR5","doi-asserted-by":"crossref","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. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"key":"37_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03246-2","volume-title":"Artificial Immune Systems","author":"PS Andrews","year":"2009","unstructured":"Andrews, P.S., Timmis, J., Owens, N.D.L., Aickelin, U., Hart, E., Hone, A., Tyrrell, A.M.: Artificial Immune Systems. York, UK (2009)"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"TF Coleman","year":"1983","unstructured":"Coleman, T.F., More, J.J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20, 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"issue":"13","key":"37_CR8","first-page":"9","volume":"6","author":"H Almarabeh","year":"2012","unstructured":"Almarabeh, H., Suleiman, A.: Heuristic algorithm for graph coloring based on maximum independent set. J. Appl. Comput. Sci. Math. 6(13), 9\u201318 (2012)","journal-title":"J. Appl. Comput. Sci. Math."},{"issue":"4","key":"37_CR9","doi-asserted-by":"crossref","first-page":"439","DOI":"10.3844\/jmssp.2006.439.441","volume":"2","author":"H Al-Omari","year":"2006","unstructured":"Al-Omari, H., Sabri, K.E.: New graph coloring algorithms. J. Math. Stat. 2(4), 439\u2013441 (2006)","journal-title":"J. Math. Stat."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Saha, S., Baboo, G., Kumar, R.: An efficient EA with multipoint guided crossover for bi-objective graph coloring problem. In: Contemporary Computing: 4th International Conference-IC3 2011, pp. 135\u2013145 (2011)","DOI":"10.1007\/978-3-642-22606-9_17"},{"issue":"3","key":"37_CR11","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"MT Jones","year":"1993","unstructured":"Jones, M.T., Plassmann, P.E.: A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14(3), 654\u2013669 (1993)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"37_CR12","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"37_CR13","volume-title":"Graph coloring algorithms","author":"DW Matula","year":"1972","unstructured":"Matula, D.W., Marble, G., Isaacson, J.D.: Graph coloring algorithms. Academic Press, New York (1972)"},{"key":"37_CR14","unstructured":"Allwright, J.R., Bordawekar, R., Coddington, P.D., Dincer, K., Martin, C.L.: A comparison of parallel graph coloring algorithms. Technical Report SCCS-666 (1995)"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:42:38Z","timestamp":1572586958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_37","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}