{"id":"https://openalex.org/W3208522216","doi":"https://doi.org/10.1016/j.jctb.2021.10.004","title":"A fast distributed algorithm for (\u0394\u202f+\u202f1)-edge-coloring","display_name":"A fast distributed algorithm for (\u0394\u202f+\u202f1)-edge-coloring","publication_year":2021,"publication_date":"2021-10-28","ids":{"openalex":"https://openalex.org/W3208522216","doi":"https://doi.org/10.1016/j.jctb.2021.10.004","mag":"3208522216"},"language":"en","primary_location":{"id":"doi:10.1016/j.jctb.2021.10.004","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jctb.2021.10.004","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","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/A5019172041","display_name":"Anton Bernshteyn","orcid":"https://orcid.org/0000-0001-8070-3408"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anton Bernshteyn","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA","School of Mathematics, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"School of Mathematics, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019172041"],"corresponding_institution_ids":["https://openalex.org/I130701444","https://openalex.org/I74973139"],"apc_list":{"value":3110,"currency":"USD","value_usd":3110},"apc_paid":null,"fwci":0.7933,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.76157515,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"152","issue":null,"first_page":"319","last_page":"352"},"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.9998999834060669,"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.9998999834060669,"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.9976000189781189,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.7537423372268677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6294759511947632},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5908105373382568},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5890964269638062},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.5551924109458923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5406756401062012},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5214173793792725},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.5162360668182373},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.514889121055603},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47039589285850525},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4687260389328003},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46576666831970215},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.4601024389266968},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44616076350212097},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4459734261035919},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.41591253876686096},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.41233718395233154},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3707183003425598},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35018545389175415},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1108836829662323},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.10691297054290771},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.060151875019073486}],"concepts":[{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.7537423372268677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6294759511947632},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5908105373382568},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5890964269638062},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.5551924109458923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5406756401062012},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5214173793792725},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.5162360668182373},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.514889121055603},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47039589285850525},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4687260389328003},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46576666831970215},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.4601024389266968},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44616076350212097},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4459734261035919},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.41591253876686096},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.41233718395233154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3707183003425598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35018545389175415},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1108836829662323},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.10691297054290771},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.060151875019073486},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.jctb.2021.10.004","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jctb.2021.10.004","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6015411898","display_name":"The Interplay between Combinatorics, Set Theory, and Dynamics","funder_award_id":"2045412","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1964089073","https://openalex.org/W1992776880","https://openalex.org/W2054910423","https://openalex.org/W2100061495","https://openalex.org/W2169102947","https://openalex.org/W2607483562","https://openalex.org/W2798588639","https://openalex.org/W2907832623","https://openalex.org/W2943290923","https://openalex.org/W2963149642","https://openalex.org/W2963662927","https://openalex.org/W2963840696","https://openalex.org/W2963868501","https://openalex.org/W2972260066","https://openalex.org/W3034790637","https://openalex.org/W3082287476","https://openalex.org/W4301139072","https://openalex.org/W6736587156","https://openalex.org/W6743531671","https://openalex.org/W6745766188","https://openalex.org/W6746132451","https://openalex.org/W6752903588","https://openalex.org/W6758040755"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4297911588","https://openalex.org/W2793500002","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W4296943582","https://openalex.org/W3157287446","https://openalex.org/W2175082514","https://openalex.org/W151506147","https://openalex.org/W4212987857"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}