{"id":"https://openalex.org/W2052352264","doi":"https://doi.org/10.1137/080732158","title":"Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation","display_name":"Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2052352264","doi":"https://doi.org/10.1137/080732158","mag":"2052352264"},"language":"en","primary_location":{"id":"doi:10.1137/080732158","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732158","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific 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/A5008376823","display_name":"Doruk Bozda\u011f","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Doruk Bozda\u011f","raw_affiliation_strings":["bozdag.1@osu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"bozdag.1@osu.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"\u00dcmt V. \u00c7ataly\u00fcrek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u00dcmt V. \u00c7ataly\u00fcrek","raw_affiliation_strings":["catalyurek.1@osu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"catalyurek.1@osu.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049685547","display_name":"Assefaw H. Gebremedhin","orcid":"https://orcid.org/0000-0001-5383-8032"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Assefaw H. Gebremedhin","raw_affiliation_strings":["agebreme@purdue.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"agebreme@purdue.edu#TAB#","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091535574","display_name":"Fredrik Manne","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fredrik Manne","raw_affiliation_strings":["Fredrik.Manne@ii.uib.no#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fredrik.Manne@ii.uib.no#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042681205","display_name":"Erik G. Boman","orcid":"https://orcid.org/0000-0003-2216-5546"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik G. Boman","raw_affiliation_strings":["egboman@sandia.gov#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"egboman@sandia.gov#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064021866","display_name":"F. \u00d6zg\u00fcner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F\u00fcsun \u00d6zg\u00fcner","raw_affiliation_strings":["ozguner@ece.osu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ozguner@ece.osu.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5438,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.89042063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"32","issue":"4","first_page":"2418","last_page":"2446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.992900013923645,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6258540153503418},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.614190399646759},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5674397349357605},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5586268305778503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5480289459228516},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5346922278404236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5014967918395996},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49228206276893616},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.47798246145248413},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43265390396118164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42370718717575073},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4189111590385437},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3899915814399719},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.30422332882881165},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20726534724235535}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6258540153503418},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.614190399646759},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5674397349357605},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5586268305778503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5480289459228516},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5346922278404236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5014967918395996},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49228206276893616},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.47798246145248413},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43265390396118164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42370718717575073},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4189111590385437},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3899915814399719},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.30422332882881165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20726534724235535},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080732158","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732158","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.226.7811","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.7811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.parallab.uib.no/%7Efredrikm/fredrik/papers/SISC2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1523448599","https://openalex.org/W1569198079","https://openalex.org/W1963564197","https://openalex.org/W1982182559","https://openalex.org/W1988783936","https://openalex.org/W1995561370","https://openalex.org/W2003363022","https://openalex.org/W2018995959","https://openalex.org/W2025508316","https://openalex.org/W2027162534","https://openalex.org/W2029746920","https://openalex.org/W2070232376","https://openalex.org/W2070299075","https://openalex.org/W2099093654","https://openalex.org/W2121253712","https://openalex.org/W2122677148","https://openalex.org/W2126721444","https://openalex.org/W2128348797","https://openalex.org/W2133400152","https://openalex.org/W2135959058","https://openalex.org/W2136871634","https://openalex.org/W2142184646","https://openalex.org/W2148606196","https://openalex.org/W2156727944","https://openalex.org/W2171679443"],"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/W2150064838","https://openalex.org/W1933089384","https://openalex.org/W2185094550","https://openalex.org/W2088823210","https://openalex.org/W2135766592"],"abstract_inverted_index":{"The":[0],"distance-2":[1,168,180],"graph":[2,13,75,185,192],"coloring":[3,169,181,200],"problem":[4,54,182],"aims":[5],"at":[6,22],"partitioning":[7],"the":[8,15,64,115,125,135,145,161,166,174,179,190,206,212],"vertex":[9],"set":[10],"of":[11,19,66,86,121,123,131,177,205],"a":[12,81,94,184,197],"into":[14],"fewest":[16],"sets":[17],"consisting":[18],"vertices":[20],"pairwise":[21],"distance":[23],"greater":[24],"than":[25],"2":[26],"from":[27,90],"each":[28],"other.":[29],"Its":[30],"applications":[31],"include":[32],"derivative":[33],"computation":[34,65],"in":[35,41,63,153],"numerical":[36],"optimization":[37],"and":[38,68,80,102,194],"channel":[39],"assignment":[40],"radio":[42],"networks.":[43],"We":[44],"present":[45],"efficient,":[46],"distributed-memory,":[47],"parallel":[48,87,136,167,198],"heuristic":[49],"algorithms":[50,116,126,137,207],"for":[51,58],"this":[52],"NP-hard":[53],"as":[55,57,106,108],"well":[56,107],"two":[59],"related":[60],"problems":[61],"used":[62,133,147],"Jacobians":[67],"Hessians.":[69],"Parallel":[70],"speedup":[71],"is":[72],"achieved":[73],"through":[74],"partitioning,":[76],"speculative":[77],"(iterative)":[78],"coloring,":[79],"bulk":[82],"synchronous":[83],"parallel\u2013like":[84],"organization":[85],"computation.":[88],"Results":[89],"experiments":[91],"conducted":[92],"on":[93,183,202],"PC":[95],"cluster":[96],"employing":[97],"up":[98],"to":[99,140,144],"96":[100],"processors":[101],"using":[103],"large-size":[104],"real-world":[105],"synthetically":[109],"generated":[110],"test":[111],"graphs":[112],"show":[113,164],"that":[114,165],"are":[117,138,155,208],"scalable.":[118],"In":[119],"terms":[120],"quality":[122],"solution,":[124],"perform":[127],"remarkably":[128],"well\u2014the":[129],"numbers":[130,146],"colors":[132],"by":[134,148,187],"observed":[139],"be":[141],"very":[142],"close":[143],"their":[149],"sequential":[150],"counterparts,":[151],"which":[152],"turn":[154],"quite":[156],"often":[157],"near":[158],"optimal.":[159],"Moreover,":[160],"experimental":[162],"results":[163],"algorithm":[170,201],"compares":[171],"favorably":[172],"with":[173],"alternative":[175],"approach":[176],"solving":[178],"$\\mathcal{G}$":[186],"first":[188],"constructing":[189],"square":[191],"$\\mathcal{G}^2$":[193],"then":[195],"applying":[196],"distance-1":[199],"$\\mathcal{G}^2$.":[203],"Implementations":[204],"made":[209],"available":[210],"via":[211],"Zoltan":[213],"toolkit.":[214]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}