{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:12:17Z","timestamp":1743127937264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030106911"},{"type":"electronic","value":"9783030106928"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10692-8_12","type":"book-chapter","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T13:53:20Z","timestamp":1547733200000},"page":"106-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation of Serial and Parallel Shared-Memory Distance-1 Graph Coloring Algorithms"],"prefix":"10.1007","author":[{"given":"Lukas","family":"Gnam","sequence":"first","affiliation":[]},{"given":"Siegfried","family":"Selberherr","sequence":"additional","affiliation":[]},{"given":"Josef","family":"Weinbub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"issue":"10","key":"12_CR1","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/j.parco.2012.07.001","volume":"38","author":"\u00dcV \u00c7ataly\u00fcrek","year":"2012","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Feo, J., Gebremedhin, A.H., Halappanavar, M., Pothen, A.: Graph coloring algorithms for multi-core and massively multithreaded architectures. Parallel Comput. 38(10), 576\u2013594 (2012)","journal-title":"Parallel Comput."},{"issue":"1","key":"12_CR2","first-page":"1:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory, 5th edn. Springer, Heidelberg (2017)","edition":"5"},{"issue":"12","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2","volume":"12","author":"AH Gebremedhin","year":"2000","unstructured":"Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Concurr. Pract. Exp. 12(12), 1131\u20131146 (2000)","journal-title":"Concurr. Pract. Exp."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first fit colorings of graphs. J. Graph Theory 12(2), 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"issue":"12","key":"12_CR6","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.parco.2010.07.002","volume":"36","author":"K Hawick","year":"2010","unstructured":"Hawick, K., Leist, A., Playne, D.: Parallel graph component labelling with GPUs and CUDA. Parallel Comput. 36(12), 655\u2013678 (2010)","journal-title":"Parallel Comput."},{"key":"12_CR7","unstructured":"Ibanez, D., Shephard, M.: Mesh adaptation for moving objects on shared memory hardware. In: Proceedings of the International Meshing Roundtable (2016)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Khorasani, F., Gupta, R., Bhuyan, L.N.: Scalable SIMD-efficient graph processing on GPUs. In: Proceedings of the International Conference on Parallel Computing Technologies, pp. 39\u201350 (2015)","DOI":"10.1109\/PACT.2015.15"},{"issue":"5","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TPDS.2016.2620142","volume":"28","author":"H Lu","year":"2017","unstructured":"Lu, H., Halappanavar, M., Chavarr\u00eda-Miranda, D., Gebremedhin, A.H., Panyala, A., Kalyanaraman, A.: Algorithms for balanced graph colorings with applications in parallel computing. IEEE Trans. Parallel Distrib. Syst. 28(5), 1240\u20131256 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0095354","volume-title":"Applied Parallel Computing Large Scale Scientific and Industrial Problems","author":"F Manne","year":"1998","unstructured":"Manne, F.: A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices. In: K\u00e5gstr\u00f6m, B., Dongarra, J., Elmroth, E., Wa\u015bniewski, J. (eds.) PARA 1998. LNCS, vol. 1541, pp. 332\u2013336. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0095354"},{"key":"12_CR11","unstructured":"Manne, F., Boman, E.: Balanced Greedy colorings of sparse random graphs. In: Proceedings of the Norwegian Informatics Conference, pp. 113\u2013124 (2005)"}],"container-title":["Lecture Notes in Computer Science","Numerical Methods and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10692-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T05:26:48Z","timestamp":1558330008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-10692-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030106911","9783030106928"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10692-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Methods and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Borovets","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nma2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nma18.fmi.uni-sofia.bg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}