{"id":"https://openalex.org/W2126721444","doi":"https://doi.org/10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2","title":"Scalable parallel graph coloring algorithms","display_name":"Scalable parallel graph coloring algorithms","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2126721444","doi":"https://doi.org/10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2","mag":"2126721444"},"language":"en","primary_location":{"id":"doi:10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5049685547","display_name":"Assefaw H. Gebremedhin","orcid":"https://orcid.org/0000-0001-5383-8032"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Assefaw Hadish Gebremedhin","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020 Bergen, Norway","DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091535574","display_name":"Fredrik Manne","orcid":null},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fredrik Manne","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020 Bergen, Norway","DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049685547"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":4.4722,"has_fulltext":false,"cited_by_count":89,"citation_normalized_percentile":{"value":0.95262917,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"12","first_page":"1131","last_page":"1146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9898999929428101,"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/computer-science","display_name":"Computer science","score":0.7778321504592896},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7618592977523804},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.7200229167938232},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7013676166534424},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6702477335929871},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6244813799858093},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.475523978471756},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4613850712776184},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.4272279739379883},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41871246695518494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4109107255935669},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3837759494781494},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3556343615055084}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7778321504592896},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7618592977523804},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7200229167938232},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7013676166534424},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6702477335929871},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6244813799858093},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.475523978471756},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4613850712776184},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.4272279739379883},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41871246695518494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4109107255935669},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3837759494781494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3556343615055084},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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":6,"locations":[{"id":"doi:10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.112.9650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.9650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.odu.edu/~assefaw/pub/cpe-color.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.21.9473","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9473","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/~assefaw/pub/coloring/cpe-color.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.6217","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.6217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.odu.edu/~assefaw/pub/cpe-color.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.9864","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.9864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/~assefaw/pub/thesis/paper1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.1996","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.1996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/%7Eassefaw/pub/thesis/paper1.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W168480530","https://openalex.org/W1499953207","https://openalex.org/W1508869097","https://openalex.org/W1595764695","https://openalex.org/W1994182141","https://openalex.org/W1995561370","https://openalex.org/W2003804316","https://openalex.org/W2034111852","https://openalex.org/W2040389062","https://openalex.org/W2059688607","https://openalex.org/W2100061495","https://openalex.org/W2108301529","https://openalex.org/W2112575355","https://openalex.org/W2167036627","https://openalex.org/W6629872620"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2031630671","https://openalex.org/W2607998022","https://openalex.org/W2059382600"],"abstract_inverted_index":{"Finding":[0],"a":[1,8,42,71],"good":[2],"graph":[3,34,47],"coloring":[4,35,48],"quickly":[5],"is":[6,51],"often":[7],"crucial":[9],"phase":[10],"in":[11,38],"the":[12,29,33,65,77,110],"development":[13],"of":[14,31,79],"efficient,":[15],"parallel":[16,46],"algorithms":[17],"for":[18,54],"many":[19],"scientific":[20],"and":[21,44,58,106],"engineering":[22],"applications.":[23],"In":[24],"this":[25],"paper":[26],"we":[27],"consider":[28],"problem":[30,36],"solving":[32],"itself":[37],"parallel.":[39],"We":[40,68],"present":[41,70],"simple":[43],"fast":[45],"heuristic":[49,73],"that":[50,74],"well":[52],"suited":[53],"shared":[55],"memory":[56],"programming":[57],"yields":[59],"an":[60,92],"almost":[61],"linear":[62],"speedup":[63],"on":[64,76,91],"PRAM":[66],"model.":[67],"also":[69],"second":[72],"improves":[75],"number":[78],"colors":[80],"used.":[81],"The":[82],"heuristics":[83],"have":[84],"been":[85],"implemented":[86],"using":[87,98],"OpenMP.":[88],"Experiments":[89],"conducted":[90],"SGI":[93],"Cray":[94],"Origin":[95],"2000":[96,116],"supercomputer":[97],"very":[99],"large":[100],"graphs":[101],"from":[102],"finite":[103],"element":[104],"methods":[105],"eigenvalue":[107],"computations":[108],"validate":[109],"theoretical":[111],"run-time":[112],"analysis.":[113],"Copyright":[114],"\u00a9":[115],"John":[117],"Wiley":[118],"&":[119],"Sons,":[120],"Ltd.":[121]},"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":8},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}