{"id":"https://openalex.org/W2542676400","doi":"https://doi.org/10.1145/3087801.3087812","title":"Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity","display_name":"Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2542676400","doi":"https://doi.org/10.1145/3087801.3087812","mag":"2542676400"},"language":"en","primary_location":{"id":"doi:10.1145/3087801.3087812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5057471294","display_name":"Leonid Barenboim","orcid":"https://orcid.org/0000-0002-9021-3549"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Leonid Barenboim","raw_affiliation_strings":["Open University of Israel, Raananna, Israel"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Raananna, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033078782","display_name":"Tzalik Maimon","orcid":null},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Tzalik Maimon","raw_affiliation_strings":["Open University of Israel, Raananna, Israel"],"affiliations":[{"raw_affiliation_string":"Open University of Israel, Raananna, Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057471294"],"corresponding_institution_ids":["https://openalex.org/I164950643"],"apc_list":null,"apc_paid":null,"fwci":2.9525,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91875154,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"175","last_page":"184"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.7634181380271912},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.7481743097305298},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7164772748947144},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.681280255317688},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.6262447237968445},{"id":"https://openalex.org/keywords/arboricity","display_name":"Arboricity","score":0.6188454627990723},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.6096628308296204},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5569258332252502},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48679158091545105},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4642781615257263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44980326294898987},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.430209755897522},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42606598138809204},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4189842939376831},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.32618528604507446},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3243574798107147},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29906123876571655},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.18501541018486023},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13369420170783997}],"concepts":[{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.7634181380271912},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.7481743097305298},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7164772748947144},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.681280255317688},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.6262447237968445},{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.6188454627990723},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.6096628308296204},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5569258332252502},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48679158091545105},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4642781615257263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44980326294898987},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.430209755897522},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42606598138809204},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4189842939376831},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.32618528604507446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3243574798107147},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29906123876571655},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.18501541018486023},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13369420170783997},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087801.3087812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W200370651","https://openalex.org/W1568961751","https://openalex.org/W1635470144","https://openalex.org/W1964089073","https://openalex.org/W1965765215","https://openalex.org/W1987125980","https://openalex.org/W1992776880","https://openalex.org/W1996066664","https://openalex.org/W2006040238","https://openalex.org/W2007218972","https://openalex.org/W2007315235","https://openalex.org/W2011595776","https://openalex.org/W2011894656","https://openalex.org/W2019905418","https://openalex.org/W2022781277","https://openalex.org/W2029386996","https://openalex.org/W2034499376","https://openalex.org/W2035522910","https://openalex.org/W2052354487","https://openalex.org/W2057128446","https://openalex.org/W2067661972","https://openalex.org/W2082903339","https://openalex.org/W2109368894","https://openalex.org/W2112009244","https://openalex.org/W2118273714","https://openalex.org/W2126517143","https://openalex.org/W2136185479","https://openalex.org/W2152316777","https://openalex.org/W2152453230","https://openalex.org/W2157562188","https://openalex.org/W2158219072","https://openalex.org/W2161176300","https://openalex.org/W2163371823","https://openalex.org/W2169102947","https://openalex.org/W2294368603","https://openalex.org/W2949268223","https://openalex.org/W2953271509","https://openalex.org/W2963830589","https://openalex.org/W4205300528","https://openalex.org/W4229705835"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W4297911588","https://openalex.org/W2046652778","https://openalex.org/W2585997002","https://openalex.org/W1546043504","https://openalex.org/W151506147","https://openalex.org/W4229960859","https://openalex.org/W2793500002","https://openalex.org/W3000828483"],"abstract_inverted_index":{"In":[0,29,97],"the":[1,24,27,30,34,49,83,98,124,128,176,191,219,253],"distributed":[2,31],"message-passing":[3],"setting":[4],"a":[5,11,114,126,131,137,146,164],"communication":[6],"network":[7],"is":[8,130,205,214],"represented":[9],"by":[10],"graph":[12,72,129],"whose":[13],"vertices":[14],"represent":[15],"processors":[16,35],"that":[17,44,87,106,226],"perform":[18],"local":[19],"computations":[20],"and":[21,234,247],"communicate":[22],"over":[23],"edges":[25,46],"of":[26,118,127,168,209,218,221,232,244],"graph.":[28],"edge-coloring":[32,61,75,104,158,204,255],"problem":[33],"are":[36,52,198],"required":[37,93],"to":[38,41,207,216],"assign":[39],"colors":[40,80,92],"edges,":[42],"such":[43,145,245],"all":[45],"incident":[47],"on":[48],"same":[50],"vertex":[51],"assigned":[53],"distinct":[54],"colors.":[55],"The":[56],"previously-known":[57,84,193],"deterministic":[58,85,103,150,157],"algorithms":[59,86,105,159,197,256],"for":[60,113,136,160,163,171,257],"employed":[62,88],"at":[63,89],"least":[64],"(2\u0394":[65],"-":[66,134],"1)":[67],"colors,":[68,112],"even":[69],"though":[70],"any":[71,172],"admits":[73],"an":[74,249],"with":[76,223],"\u0394":[77,109],"+":[78,110],"1":[79],"[36].":[81],"Moreover,":[82],"most":[90],"O(\u0394)":[91],"superlogarithmic":[94],"time":[95,189],"[3,6,7,17].":[96],"current":[99],"paper":[100],"we":[101],"devise":[102,154],"employ":[107],"only":[108],"o(\u0394)":[111],"very":[115,165],"wide":[116,166],"family":[117,220],"graphs.":[119,211,237,259],"Specifically,":[120,170],"as":[121,123,248],"long":[122],"arboricity":[125],"=":[132],"O(\u03941":[133],"\u03b5),":[135],"constant":[138],"\u03b5":[139],">":[140],"0,":[141],"our":[142,183],"algorithm":[143,185],"computes":[144],"coloring":[147],"within":[148],"polylogarithmic":[149],"time.":[151],"We":[152,238],"also":[153,251],"significantly":[155,239],"improved":[156,254],"general":[161,258],"graphs":[162,222,231],"range":[167,177],"parameters.":[169],"value":[173],"\u03ba":[174],"in":[175],"[4\u0394,":[178],"2o(log":[179],"\u0394)":[180],"\u22c5":[181],"\u0394],":[182],"\u03ba-edge-coloring":[184,194],"has":[186],"smaller":[187],"running":[188],"than":[190],"best":[192],"algorithms.":[195],"Our":[196,212],"actually":[199],"much":[200],"more":[201],"general,":[202],"since":[203],"equivalent":[206],"vertex-coloring":[208,217,243],"line":[210,228,230],"method":[213],"applicable":[215],"bounded":[224],"diversity":[225],"contains":[227],"graphs,":[229,246],"hypergraphs,":[233],"many":[235],"other":[236],"improve":[240],"upon":[241],"previous":[242],"implication":[250],"obtain":[252]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}