{"id":"https://openalex.org/W4285043729","doi":"https://doi.org/10.1145/3543545","title":"Improving the Speed and Quality of Parallel Graph Coloring","display_name":"Improving the Speed and Quality of Parallel Graph Coloring","publication_year":2022,"publication_date":"2022-07-11","ids":{"openalex":"https://openalex.org/W4285043729","doi":"https://doi.org/10.1145/3543545"},"language":"en","primary_location":{"id":"doi:10.1145/3543545","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543545","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047196779","display_name":"Ghadeer Alabandi","orcid":"https://orcid.org/0000-0001-5522-9441"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ghadeer Alabandi","raw_affiliation_strings":["Texas State University, San Marcos, TX, United States"],"raw_orcid":"https://orcid.org/0000-0001-5522-9441","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, TX, United States","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103125276","display_name":"Martin Burtscher","orcid":"https://orcid.org/0000-0001-7717-3354"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Burtscher","raw_affiliation_strings":["Texas State University, San Marcos, TX, United States"],"raw_orcid":"https://orcid.org/0000-0001-7717-3354","affiliations":[{"raw_affiliation_string":"Texas State University, San Marcos, TX, United States","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047196779"],"corresponding_institution_ids":["https://openalex.org/I13511017"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10357795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"3","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.7850848436355591},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7837079763412476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7702890038490295},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.770212709903717},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6386693716049194},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.5204996466636658},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4862617254257202},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48301422595977783},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.44625669717788696},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.41914936900138855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36455926299095154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31612324714660645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.189666748046875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07863998413085938}],"concepts":[{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.7850848436355591},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7837079763412476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7702890038490295},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.770212709903717},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6386693716049194},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.5204996466636658},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4862617254257202},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48301422595977783},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.44625669717788696},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.41914936900138855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36455926299095154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31612324714660645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.189666748046875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07863998413085938},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3543545","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543545","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W149461665","https://openalex.org/W1572663059","https://openalex.org/W1718162526","https://openalex.org/W1984291654","https://openalex.org/W1991173503","https://openalex.org/W1994182141","https://openalex.org/W2028047126","https://openalex.org/W2044733003","https://openalex.org/W2084715564","https://openalex.org/W2100061495","https://openalex.org/W2107251158","https://openalex.org/W2108301529","https://openalex.org/W2126721444","https://openalex.org/W2134427337","https://openalex.org/W2167830231","https://openalex.org/W2171679443","https://openalex.org/W2183902778","https://openalex.org/W2286053514","https://openalex.org/W2460554018","https://openalex.org/W2476946651","https://openalex.org/W2626696598","https://openalex.org/W2798467024","https://openalex.org/W2808229499","https://openalex.org/W2947061677","https://openalex.org/W2999787421","https://openalex.org/W3006582303","https://openalex.org/W3104688632","https://openalex.org/W3125649654","https://openalex.org/W4244570612"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2983282793","https://openalex.org/W4285043729","https://openalex.org/W2741258438","https://openalex.org/W2998575712","https://openalex.org/W2166988774","https://openalex.org/W2350675432"],"abstract_inverted_index":{"Graph":[0],"coloring":[1,48],"assigns":[2],"a":[3,9,23,88,147],"color":[4],"to":[5,62,91,106,139],"each":[6],"vertex":[7],"of":[8,79,110],"graph":[10],"such":[11],"that":[12,33,39,51],"no":[13],"two":[14,77],"adjacent":[15],"vertices":[16],"get":[17],"the":[18,80,93,108,118,127,130,134,155,165,170],"same":[19],"color.":[20],"It":[21],"is":[22,150],"key":[24],"building":[25],"block":[26],"in":[27,126,154],"many":[28],"applications.":[29],"In":[30],"practice,":[31],"solutions":[32],"require":[34],"fewer":[35,162],"distinct":[36],"colors":[37,163],"and":[38,129,157],"can":[40],"be":[41,63],"computed":[42],"faster":[43,153],"are":[44],"typically":[45],"preferred.":[46],"Various":[47],"heuristics":[49,60],"exist":[50],"provide":[52],"different":[53],"quality":[54,136],"versus":[55],"speed":[56],"tradeoffs.":[57],"The":[58],"highest-quality":[59],"tend":[61],"slow.":[64],"To":[65],"improve":[66,133],"performance,":[67],"several":[68],"parallel":[69],"implementations":[70],"have":[71],"been":[72],"proposed.":[73],"This":[74],"paper":[75],"describes":[76],"improvements":[78],"widely":[81],"used":[82],"LDF":[83],"heuristic.":[84],"First,":[85],"we":[86,101],"present":[87,102],"\u201cshortcutting\u201d":[89],"approach":[90,120],"increase":[92],"parallelism":[94,125],"by":[95,137],"non-speculatively":[96],"breaking":[97],"data":[98],"dependencies.":[99],"Second,":[100],"\u201ccolor":[103],"reduction\u201d":[104],"techniques":[105,132],"boost":[107],"solution":[109],"LDF.":[111],"On":[112],"18":[113],"graphs":[114],"from":[115,169],"various":[116],"domains,":[117],"shortcutting":[119],"yields":[121],"2.5":[122],"times":[123,152],"more":[124],"mean,":[128],"color-reduction":[131],"result":[135],"up":[138],"20%.":[140],"Our":[141],"deterministic":[142],"CUDA":[143],"implementation":[144],"running":[145],"on":[146],"Titan":[148],"V":[149],"2.9":[151],"mean":[156],"uses":[158],"as":[159,164],"few":[160],"or":[161],"best":[166],"GPU":[167],"codes":[168],"literature.":[171]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}