{"id":"https://openalex.org/W2078823202","doi":"https://doi.org/10.1109/hipc.2011.6152726","title":"Improving graph coloring on distributed-memory parallel computers","display_name":"Improving graph coloring on distributed-memory parallel computers","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2078823202","doi":"https://doi.org/10.1109/hipc.2011.6152726","mag":"2078823202"},"language":"en","primary_location":{"id":"doi:10.1109/hipc.2011.6152726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2011.6152726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 18th International Conference on High Performance Computing","raw_type":"proceedings-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/A5020527664","display_name":"Ahmet Erdem Sar\u0131y\u00fcce","orcid":"https://orcid.org/0000-0002-4945-6821"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ahmet Erdem Sariyuce","raw_affiliation_strings":["Department of Biomedical Informatics, Ohio State University, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Biomedical Informatics, Ohio State University, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028427671","display_name":"\u00c9rik Saule","orcid":"https://orcid.org/0000-0003-1634-9234"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik Saule","raw_affiliation_strings":["Department of Biomedical Informatics, Ohio State Uinversity, USA","Department of Biomedical Informatics, Ohio State University, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Biomedical Informatics, Ohio State Uinversity, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Department of Biomedical Informatics, Ohio State University, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026046737","display_name":"\u00dcmit V. \u00c7ataly\u00fcrek","orcid":"https://orcid.org/0000-0002-5625-3758"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Umit V. Catalyurek","raw_affiliation_strings":["Department of Biomedical Informatics, Ohio State University, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Biomedical Informatics, Ohio State University, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020527664"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":1.3015,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80610665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3149","issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.995199978351593,"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/T12288","display_name":"Optimization and Search Problems","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.8193546533584595},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6203610897064209},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.596482515335083},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5472802519798279},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.5164470672607422},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4704990088939667},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.46956610679626465},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4607471227645874},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.42274850606918335},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3897470235824585},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.3026285469532013}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8193546533584595},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6203610897064209},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.596482515335083},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5472802519798279},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.5164470672607422},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4704990088939667},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.46956610679626465},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4607471227645874},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.42274850606918335},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3897470235824585},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.3026285469532013}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hipc.2011.6152726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2011.6152726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 18th International Conference on High Performance Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W65989689","https://openalex.org/W149461665","https://openalex.org/W168480530","https://openalex.org/W1482680420","https://openalex.org/W1589401323","https://openalex.org/W1963564197","https://openalex.org/W1994182141","https://openalex.org/W1995231650","https://openalex.org/W1995561370","https://openalex.org/W2034111852","https://openalex.org/W2040389062","https://openalex.org/W2059688607","https://openalex.org/W2064383783","https://openalex.org/W2083883919","https://openalex.org/W2100061495","https://openalex.org/W2108301529","https://openalex.org/W2118866757","https://openalex.org/W2122677148","https://openalex.org/W2126721444","https://openalex.org/W2136871634","https://openalex.org/W2283526767","https://openalex.org/W2610183793","https://openalex.org/W3148529197","https://openalex.org/W3202477519","https://openalex.org/W4285719527","https://openalex.org/W6606889394","https://openalex.org/W6801945984"],"related_works":["https://openalex.org/W2026512611","https://openalex.org/W1985165680","https://openalex.org/W4245497162","https://openalex.org/W2353146130","https://openalex.org/W1990817968","https://openalex.org/W4205439893","https://openalex.org/W2150064838","https://openalex.org/W1933089384","https://openalex.org/W2185094550","https://openalex.org/W2088823210"],"abstract_inverted_index":{"Graph":[0],"coloring":[1,48,137],"is":[2],"a":[3,74,101],"combinatorial":[4],"optimization":[5],"problem":[6],"that":[7,19,79],"classically":[8],"appears":[9],"in":[10,24,54,73],"distributed":[11,38,75,102,135],"computing":[12],"to":[13,83],"identify":[14],"the":[15,60,86,98,111,118,129],"sets":[16],"of":[17,62,88,100,113,131],"tasks":[18],"can":[20,81],"be":[21],"safely":[22],"performed":[23],"parallel.":[25],"Despite":[26],"many":[27],"existing":[28,45],"efficient":[29],"sequential":[30],"algorithms":[31],"being":[32],"known":[33],"for":[34,134],"this":[35,55],"NP-Complete":[36],"problem,":[37],"variants":[39],"are":[40],"challenging.":[41],"Building":[42],"on":[43,90,123],"an":[44],"distributed-memory":[46],"graph":[47,136],"framework,":[49],"we":[50,58,96],"investigate":[51,59,97,128],"two":[52,63],"techniques":[53],"paper.":[56],"First,":[57],"application":[61],"different":[64],"vertex-visit":[65],"orderings,":[66],"namely":[67],"Largest":[68],"First":[69],"and":[70,77],"Smallest":[71],"Last,":[72],"context":[76],"show":[78],"they":[80],"help":[82],"significantly":[84],"decrease":[85],"number":[87,112],"colors,":[89],"small-to":[91],"medium-scale":[92],"parallel":[93],"architectures.":[94],"Second,":[95],"use":[99,130],"post-processing":[103],"operation,":[104],"called":[105],"recoloring,":[106],"which":[107],"further":[108],"drastically":[109],"improves":[110],"colors":[114],"while":[115],"not":[116],"increasing":[117],"runtime":[119],"more":[120],"than":[121],"twofold":[122],"large":[124],"graphs.":[125],"We":[126],"also":[127],"multicore":[132],"architectures":[133],"algorithms.":[138]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}