{"id":"https://openalex.org/W1994182141","doi":"https://doi.org/10.1137/0914041","title":"A Parallel Graph Coloring Heuristic","display_name":"A Parallel Graph Coloring Heuristic","publication_year":1993,"publication_date":"1993-05-01","ids":{"openalex":"https://openalex.org/W1994182141","doi":"https://doi.org/10.1137/0914041","mag":"1994182141"},"language":"en","primary_location":{"id":"doi:10.1137/0914041","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0914041","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/A5108702972","display_name":"Mark T. Jones","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark T. Jones","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069052130","display_name":"Paul E. Plassmann","orcid":"https://orcid.org/0000-0001-5413-474X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul E. Plassmann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7811,"has_fulltext":false,"cited_by_count":228,"citation_normalized_percentile":{"value":0.96944507,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"14","issue":"3","first_page":"654","last_page":"669"},"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.9997000098228455,"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.9997000098228455,"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.9980999827384949,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6409692764282227},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5677585005760193},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5584862232208252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5368144512176514},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5367056131362915},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5287263989448547},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4976251423358917},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42280739545822144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37479451298713684},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37434881925582886},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34896576404571533},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3439291715621948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23239079117774963}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6409692764282227},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5677585005760193},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5584862232208252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5368144512176514},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5367056131362915},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5287263989448547},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4976251423358917},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42280739545822144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37479451298713684},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37434881925582886},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34896576404571533},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3439291715621948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23239079117774963},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0914041","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0914041","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.52.6062","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.6062","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://info.mcs.anl.gov/pub/tech_reports/reports/P246.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1980758416","https://openalex.org/W1982182559","https://openalex.org/W1995561370","https://openalex.org/W2071649025","https://openalex.org/W2100061495","https://openalex.org/W2114030927","https://openalex.org/W2167036627","https://openalex.org/W4210731599"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W2041180560"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,17,24,82,101,133],"computing":[3],"good":[4],"graph":[5,39,139],"colorings":[6,75],"arises":[7],"in":[8,14,21],"many":[9],"diverse":[10],"applications,":[11,67],"such":[12],"as":[13],"the":[15,22,68,83,97,102,105,122,129,138],"estimation":[16],"sparse":[18,31],"Jacobians":[19],"and":[20,73],"development":[23],"efficient,":[25],"parallel":[26,47],"iterative":[27],"methods":[28],"for":[29,61,128,137],"solving":[30],"linear":[32,85],"systems.":[33],"This":[34,116],"paper":[35],"presents":[36],"an":[37,53,119],"asynchronous":[38],"coloring":[40,140],"heuristic":[41,69,103,136],"well":[42],"suited":[43],"to":[44],"distributed":[45],"memory":[46],"computers.":[48],"Experimental":[49],"results":[50],"obtained":[51],"on":[52],"Intel":[54],"iPSC/860":[55],"are":[56],"presented,":[57],"which":[58],"demonstrate":[59],"that,":[60],"graphs":[62],"arising":[63],"from":[64],"finite":[65],"element":[66],"exhibits":[70],"scalable":[71],"performance":[72],"generates":[74],"usually":[76],"within":[77],"three":[78],"or":[79],"four":[80],"colors":[81],"best-known":[84],"time":[86,100,132],"sequential":[87],"heuristics.":[88],"For":[89],"bounded":[90,110],"degree":[91],"graphs,":[92],"it":[93],"is":[94,109,118],"shown":[95],"that":[96],"expected":[98,130],"running":[99,131],"under":[104],"P-RAM":[106],"computation":[107],"model":[108],"by":[111],"$EO(\\log":[112],"(n)/\\log":[113],"\\log":[114],"(n))$.":[115],"bound":[117,127],"improvement":[120],"over":[121],"previously":[123],"known":[124],"best":[125],"upper":[126],"a":[134],"random":[135],"problem.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}