{"id":"https://openalex.org/W2983776960","doi":"https://doi.org/10.1145/3365004","title":"Distributed Edge Coloring and a Special Case of the Constructive Lov\u00e1sz Local Lemma","display_name":"Distributed Edge Coloring and a Special Case of the Constructive Lov\u00e1sz Local Lemma","publication_year":2019,"publication_date":"2019-11-15","ids":{"openalex":"https://openalex.org/W2983776960","doi":"https://doi.org/10.1145/3365004","mag":"2983776960"},"language":"en","primary_location":{"id":"doi:10.1145/3365004","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3365004","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3365004","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3365004","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061847213","display_name":"Yi\u2010Jun Chang","orcid":"https://orcid.org/0000-0002-0109-2432"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi-Jun Chang","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030972995","display_name":"Qizheng He","orcid":"https://orcid.org/0000-0002-2518-1114"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qizheng He","raw_affiliation_strings":["IIIS, Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIIS, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101412259","display_name":"Wenzheng Li","orcid":"https://orcid.org/0009-0008-4536-8948"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenzheng Li","raw_affiliation_strings":["IIIS, Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIIS, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064067007","display_name":"Jara Uitto","orcid":"https://orcid.org/0000-0002-5179-5056"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]},{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH","DE"],"is_corresponding":false,"raw_author_name":"Jara Uitto","raw_affiliation_strings":["ETH Z\u00fcrich, Switzerland and University of Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Switzerland and University of Freiburg, Germany","institution_ids":["https://openalex.org/I35440088","https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7353,"has_fulltext":true,"cited_by_count":25,"citation_normalized_percentile":{"value":0.86528415,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"1","first_page":"1","last_page":"51"},"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.996399998664856,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.7106761336326599},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6652079820632935},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6550186276435852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6250609159469604},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5383551716804504},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5268707871437073},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5168660283088684},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5142506957054138},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4989316463470459},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4563901424407959},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4375857412815094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26103854179382324},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11674395203590393},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.07070684432983398}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7106761336326599},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6652079820632935},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6550186276435852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6250609159469604},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5383551716804504},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5268707871437073},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5168660283088684},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5142506957054138},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4989316463470459},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4563901424407959},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4375857412815094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26103854179382324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11674395203590393},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.07070684432983398},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3365004","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3365004","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3365004","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:freidok.uni-freiburg.de:267689","is_oa":false,"landing_page_url":"https://freidok.uni-freiburg.de/data/267689","pdf_url":null,"source":{"id":"https://openalex.org/S4306401057","display_name":"FreiDok plus (Universit\u00e4tsbibliothek Freiburg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I161046081","host_organization_name":"University of Freiburg","host_organization_lineage":["https://openalex.org/I161046081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms. - 16, 1 (2020) , 1-51, ISSN: 1549-6333","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3365004","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3365004","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3365004","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1011837445","display_name":"AF: Small: Locality and Energy in Distributed Computing","funder_award_id":"1815316","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4078692053","display_name":null,"funder_award_id":"CCF-1514383, CCF-1637546, and CCF-1815316","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4167357606","display_name":"AitF:Collaborative Research: Bridging the Gap between Theory and Practice for Matching and Edge Cover Problems","funder_award_id":"1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6591826966","display_name":null,"funder_award_id":"CCF-1815316","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6809486582","display_name":null,"funder_award_id":"CCF-1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8864822960","display_name":"AF:  Medium: Collaborative Research: Hardness in Polynomial Time","funder_award_id":"1514383","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8959633998","display_name":null,"funder_award_id":"CCF-1514383","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":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2983776960.pdf","grobid_xml":"https://content.openalex.org/works/W2983776960.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1666479227","https://openalex.org/W1964089073","https://openalex.org/W1965765215","https://openalex.org/W1970330908","https://openalex.org/W1984697505","https://openalex.org/W1989134823","https://openalex.org/W1989274820","https://openalex.org/W1998643836","https://openalex.org/W2004229660","https://openalex.org/W2016190491","https://openalex.org/W2017345786","https://openalex.org/W2022392080","https://openalex.org/W2027586324","https://openalex.org/W2046229563","https://openalex.org/W2052354487","https://openalex.org/W2054910423","https://openalex.org/W2056050680","https://openalex.org/W2065826935","https://openalex.org/W2067661972","https://openalex.org/W2100061495","https://openalex.org/W2102669784","https://openalex.org/W2109693504","https://openalex.org/W2136185479","https://openalex.org/W2152453230","https://openalex.org/W2163371823","https://openalex.org/W2467514673","https://openalex.org/W2552762966","https://openalex.org/W2797253418","https://openalex.org/W2907309485","https://openalex.org/W2913663107","https://openalex.org/W2949268223","https://openalex.org/W2972260066","https://openalex.org/W3014163002","https://openalex.org/W3103554207","https://openalex.org/W4205300528","https://openalex.org/W4210634265","https://openalex.org/W4229705835","https://openalex.org/W4253941431","https://openalex.org/W4254031789","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2011106535","https://openalex.org/W1541068124","https://openalex.org/W1994598067","https://openalex.org/W2036758175","https://openalex.org/W2007715402","https://openalex.org/W1525123833","https://openalex.org/W2475816962","https://openalex.org/W2004524662","https://openalex.org/W2962985337","https://openalex.org/W2899261484"],"abstract_inverted_index":{"The":[0,149],"complexity":[1,26],"of":[2,15,27,53,152],"distributed":[3,169,269],"edge":[4,28,127],"coloring":[5,29,63,106,128,155,186,293],"depends":[6],"heavily":[7],"on":[8,84,120,241,259,288],"the":[9,16,25,31,49,178,230,235,246],"palette":[10,36,133],"size":[11,37],"as":[12,42,135,137],"a":[13,91,125,143,168,184,267],"function":[14],"maximum":[17],"degree":[18],"\u0394.":[19],"In":[20],"this":[21,263],"article,":[22],"we":[23,47,88,182,265],"explore":[24],"in":[30,34,187,228],"LOCAL":[32],"model":[33],"different":[35],"regimes.":[38],"Our":[39],"results":[40],"are":[41],"follows.":[43],"Lower":[44],"Bounds:":[45],"First,":[46],"simplify":[48],"round":[50],"elimination":[51],"technique":[52],"Brandt":[54],"et":[55],"al.":[56],"[16]":[57],"and":[58,75],"prove":[59],"that":[60,90,130,245],"(2\u0394":[61],"\u22122)-edge":[62],"requires":[64,111],"\u03a9":[65,76,112,222,247,353],"(log":[66,77,189,196,205,210,248,299,325],"\u0394":[67,78,138,201,206,225,249,317,345],"log":[68,114,211,250,306,307,310,311,312,315,316,318,335,336,339,340,341,344,346],"n":[69,79,115,190,207,212,229,251,308,313,319,337,342,347],")":[70,80,116,165,191,208,213,252],"time":[71,81,151,192,218,321,349],"with":[72,234],"high":[73],"probability":[74],"deterministically,":[82],"even":[83],"trees":[85,296],".":[86],"Second,":[87],"show":[89,244],"natural":[92,144],"approach":[93],"to":[94,167],"computing":[95],"(\u0394":[96,113],"+1)-edge":[97],"colorings":[98],"(Vizing\u2019s":[99],"theorem),":[100],"namely,":[101],"extending":[102],"an":[103],"arbitrary":[104],"partial":[105],"by":[107,160],"iteratively":[108],"recoloring":[109],"subgraphs,":[110],"time.":[117],"Upper":[118,239],"Bounds":[119,240],"General":[121],"Graphs:":[122],"We":[123,243],"give":[124],"randomized":[126,147],"algorithm":[129,156,273,294],"can":[131,255],"use":[132],"sizes":[134],"small":[136],"+":[139,209,215],"\u00d5(\u221a\u0394),":[140],"which":[141,279],"is":[142,157,226,232],"barrier":[145],"for":[146,274,295],"approaches.":[148],"running":[150],"our":[153,291],"(1+\u03f5)\u0394-edge":[154,185,292],"usually":[158],"dominated":[159],"O":[161,188,204,283,298,332],"(\\log":[162],"\u03f5":[163,194,220,323,351],"\u22121":[164],"calls":[166],"Lov\u00e1sz":[170,270],"local":[171,271],"lemma":[172,272],"(LLL)":[173],"algorithm.":[174,238],"For":[175],"example,":[176],"using":[177],"Chung-Pettie-Su":[179],"LLL":[180,237],"algorithm,":[181],"compute":[183],"when":[193,219,322,350],"\u2265":[195,324],"3":[197,214,326],"\u0394)":[198,327],"/":[199,301,328],"\u221a":[200,329],",":[202,278,314,343],"or":[203,331],"o":[216],"(1)":[217],"=":[221,352],"(1).":[223,354],"When":[224],"sublogarithmic":[227],"performance":[231],"improved":[233],"Ghaffari-Harris-Kuhn":[236],"Trees:":[242],"lower":[253],"bound":[254],"be":[256],"nearly":[257],"matched":[258],"trees.":[260,289],"To":[261],"establish":[262],"result,":[264],"develop":[266],"new":[268],"tree-structured":[275],"dependency":[276],"graphs":[277],"arise":[280],"naturally":[281],"from":[282],"(1)-round":[284],"probabilistic":[285],"algorithms":[286],"run":[287],"Specifically,":[290],"takes":[297],"(1":[300],"\u03f5))":[302],"\u22c5":[303],"max":[304],"{":[305,334],"\\":[309,338],"}":[320],"\u0394,":[330],"(max":[333],"})":[348]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}