{"id":"https://openalex.org/W2999787421","doi":"https://doi.org/10.1145/3332466.3374519","title":"Increasing the parallelism of graph coloring via shortcutting","display_name":"Increasing the parallelism of graph coloring via shortcutting","publication_year":2020,"publication_date":"2020-02-19","ids":{"openalex":"https://openalex.org/W2999787421","doi":"https://doi.org/10.1145/3332466.3374519","mag":"2999787421"},"language":"en","primary_location":{"id":"doi:10.1145/3332466.3374519","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374519","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374519","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374519","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047196779","display_name":"Ghadeer Alabandi","orcid":"https://orcid.org/0000-0001-5522-9441"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ghadeer Alabandi","raw_affiliation_strings":["Texas State University"],"affiliations":[{"raw_affiliation_string":"Texas State University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041193363","display_name":"Evan Powers","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Evan Powers","raw_affiliation_strings":["Texas State University"],"affiliations":[{"raw_affiliation_string":"Texas State University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103125276","display_name":"Martin Burtscher","orcid":"https://orcid.org/0000-0001-7717-3354"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Burtscher","raw_affiliation_strings":["Texas State University"],"affiliations":[{"raw_affiliation_string":"Texas State University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047196779"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1777,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80705157,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"262","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.7355390787124634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7191920280456543},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7081713676452637},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5292614698410034},{"id":"https://openalex.org/keywords/titan","display_name":"Titan (rocket family)","score":0.45850804448127747},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.4564535617828369},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.4484628438949585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22383898496627808}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7355390787124634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7191920280456543},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7081713676452637},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5292614698410034},{"id":"https://openalex.org/C50805821","wikidata":"https://www.wikidata.org/wiki/Q1136670","display_name":"Titan (rocket family)","level":2,"score":0.45850804448127747},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.4564535617828369},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4484628438949585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22383898496627808},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3332466.3374519","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374519","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374519","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3332466.3374519","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3332466.3374519","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3332466.3374519","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4873934642","display_name":null,"funder_award_id":"1406304","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309480","display_name":"Nvidia","ror":"https://ror.org/03jdj4y14"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2999787421.pdf","grobid_xml":"https://content.openalex.org/works/W2999787421.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W149461665","https://openalex.org/W1572663059","https://openalex.org/W1984291654","https://openalex.org/W1985291160","https://openalex.org/W1990223985","https://openalex.org/W1991173503","https://openalex.org/W1994182141","https://openalex.org/W2044733003","https://openalex.org/W2084715564","https://openalex.org/W2100061495","https://openalex.org/W2107251158","https://openalex.org/W2108301529","https://openalex.org/W2148641426","https://openalex.org/W2156898111","https://openalex.org/W2167830231","https://openalex.org/W2183902778","https://openalex.org/W2460554018","https://openalex.org/W3006582303","https://openalex.org/W3104688632","https://openalex.org/W3125649654","https://openalex.org/W4244570612"],"related_works":["https://openalex.org/W3213381848","https://openalex.org/W2017587301","https://openalex.org/W2012954338","https://openalex.org/W2005148983","https://openalex.org/W4386975487","https://openalex.org/W2096672917","https://openalex.org/W2009169896","https://openalex.org/W2392023973","https://openalex.org/W2939411666","https://openalex.org/W1595672120"],"abstract_inverted_index":{"Graph":[0],"coloring":[1,34,85],"is":[2,24,41,109],"an":[3,76,94],"assignment":[4],"of":[5,10,39,45,96],"colors":[6,40,121],"to":[7,54],"the":[8,20,46,50,71,80,84,123,128],"vertices":[9,18],"a":[11,25,33,36,106],"graph":[12],"such":[13],"that":[14,78],"no":[15],"two":[16],"adjacent":[17],"get":[19],"same":[21],"color.":[22],"It":[23],"key":[26],"building":[27],"block":[28],"in":[29],"many":[30],"applications.":[31],"Finding":[32],"with":[35],"minimal":[37],"number":[38],"often":[42],"only":[43],"part":[44],"problem.":[47],"In":[48],"addition,":[49],"solution":[51],"also":[52],"needs":[53],"be":[55],"computed":[56],"quickly.":[57],"Several":[58],"parallel":[59],"implementations":[60],"exist,":[61],"but":[62],"they":[63],"may":[64],"suffer":[65],"from":[66,127],"low":[67],"parallelism":[68,81],"depending":[69],"on":[70,105,113],"input":[72],"graph.":[73],"We":[74],"present":[75],"approach":[77],"increases":[79],"without":[82],"affecting":[83],"quality.":[86],"On":[87],"18":[88],"test":[89],"graphs,":[90],"our":[91],"technique":[92],"yields":[93],"average":[95,114],"3.4":[97],"times":[98,111],"more":[99],"parallelism.":[100],"Our":[101],"CUDA":[102],"implementation":[103],"running":[104],"Titan":[107],"V":[108],"2.9":[110],"faster":[112],"and":[115],"uses":[116],"as":[117,122],"few":[118],"or":[119],"fewer":[120],"best":[124],"GPU":[125],"codes":[126],"literature.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2020,"cited_by_count":4}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}