{"id":"https://openalex.org/W4416123588","doi":"https://doi.org/10.1007/978-3-032-26465-7_21","title":"Towards Optimal Distributed Delta Coloring","display_name":"Towards Optimal Distributed Delta Coloring","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W4416123588","doi":"https://doi.org/10.1007/978-3-032-26465-7_21"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-26465-7_21","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-26465-7_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/978-3-032-26465-7_21","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118198447","display_name":"Manuel Jakob","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]},{"id":"https://openalex.org/I4210095425","display_name":"Graz University Hospital","ror":"https://ror.org/00pw0pp06","country_code":"AT","type":"healthcare","lineage":["https://openalex.org/I4210095425"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Manuel Jakob","raw_affiliation_strings":["TU Graz, Rechbauerstra\u00dfe 12, 8010, Graz, Austria"],"raw_orcid":"https://orcid.org/0009-0009-0229-0287","affiliations":[{"raw_affiliation_string":"TU Graz, Rechbauerstra\u00dfe 12, 8010, Graz, Austria","institution_ids":["https://openalex.org/I4210095425","https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083037622","display_name":"Yannic Maus","orcid":"https://orcid.org/0000-0003-4062-6991"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]},{"id":"https://openalex.org/I4210095425","display_name":"Graz University Hospital","ror":"https://ror.org/00pw0pp06","country_code":"AT","type":"healthcare","lineage":["https://openalex.org/I4210095425"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Yannic Maus","raw_affiliation_strings":["TU Graz, Rechbauerstra\u00dfe 12, 8010, Graz, Austria"],"raw_orcid":"https://orcid.org/0000-0003-4062-6991","affiliations":[{"raw_affiliation_string":"TU Graz, Rechbauerstra\u00dfe 12, 8010, Graz, Austria","institution_ids":["https://openalex.org/I4210095425","https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5118198447"],"corresponding_institution_ids":["https://openalex.org/I4092182","https://openalex.org/I4210095425"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01528014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"391","last_page":"410"},"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.8453999757766724,"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.8453999757766724,"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.12389999628067017,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.005200000014156103,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/sublinear-function","display_name":"Sublinear function","score":0.5771999955177307},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5479999780654907},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.53329998254776},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.45820000767707825},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4374000132083893},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.4203000068664551},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4032000005245209},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.3921000063419342},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3553999960422516}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5771999955177307},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5479999780654907},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5248000025749207},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.45820000767707825},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4374000132083893},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.4203000068664551},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3912000060081482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3813000023365021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36489999294281006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.3463999927043915},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.3449000120162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33980000019073486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.33820000290870667},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2906000018119812},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.2777999937534332},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2718999981880188},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.25060001015663147},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-032-26465-7_21","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-26465-7_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:2504.03080","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.03080","pdf_url":"https://arxiv.org/pdf/2504.03080","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2504.03080","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.03080","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/978-3-032-26465-7_21","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-26465-7_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,90],"contrast":[1],"to":[2,212,249],"the":[3,9,32,37,53,65,76,110,114,123,152,163,193,202,208,234,274,278],"$$(\\varDelta":[4],"+1)$$":[5],"-vertex":[6,12],"coloring":[7,13,140,144],"problem,":[8],"$$\\varDelta":[10,80,100,121,148,176,265],"$$":[11,81,101,122,149,177,266],"problem":[14,50,54,115,279],"cannot":[15],"be":[16,56],"solved":[17,57],"with":[18,145,181],"a":[19,25,95,198,252],"simple":[20],"sequential":[21],"greedy":[22],"algorithm.":[23,89],"As":[24],"result":[26,248],"it":[27],"has":[28,168],"become":[29],"one":[30],"of":[31,39,78],"prototypical":[33],"problems":[34,43],"for":[35,104,113,143,162,210,233,240,264,277],"understanding":[36],"complexity":[38,125],"non-greedy":[40,242],"distributed":[41,136],"graph":[42,139,153],"on":[44,116,280],"constant-degree":[45,107,282],"graphs.":[46,118],"The":[47],"major":[48,194],"open":[49],"is":[51,126,217],"whether":[52],"can":[55],"deterministically":[58],"in":[59,75,173],"logarithmic":[60],"time,":[61],"which":[62],"would":[63],"match":[64],"lower":[66,111,275],"bound":[67,112,276],"[Chang":[68],"et":[69,285],"al.,":[70],"FOCS\u201916].":[71],"Despite":[72],"recent":[73,135,174],"progress":[74],"design":[77],"efficient":[79],"-coloring":[82,102,178,267],"algorithms,":[83,179],"we":[84,93,245],"lack":[85],"an":[86,230],"asymptotically":[87],"optimal":[88,231],"this":[91,166],"work":[92],"present":[94,197],"$$O(\\log":[96],"n)$$":[97],"-round":[98,262],"deterministic":[99,222],"algorithm":[103,160,232,263],"locally":[105,268],"dense":[106,157,189,203,269],"graphs,":[108],"matching":[109],"general":[117,120,235,281],"For":[119],"algorithms\u2019":[124],"$$\\min":[127,254],"\\{\\widetilde{O}(\\log":[128,255],"^{5/3}n),O(\\varDelta":[129],"+\\log":[130,259],"n)\\}$$":[131,261],".":[132],"Almost":[133],"all":[134],"and":[137,156,187,205,224,237],"sublinear":[138],"algorithms":[141,223],"(also":[142],"more":[146],"than":[147],"colors)":[150],"decompose":[151],"into":[154],"sparse":[155,170,182,213],"parts.":[158,214],"Our":[159,215],"works":[161],"case":[164],"that":[165,200,271],"decomposition":[167],"no":[169],"vertices.":[171],"Ironically,":[172],"(randomized)":[175],"dealing":[180],"parts":[183,190,204],"was":[184],"relatively":[185],"easy":[186],"these":[188],"arguably":[191],"posed":[192],"hurdle.":[195],"We":[196],"solution":[199],"addresses":[201],"may":[206],"have":[207],"potential":[209],"extension":[211],"approach":[216],"fundamentally":[218],"different":[219],"from":[220],"prior":[221],"hence":[225],"hopefully":[226],"contributes":[227],"towards":[228],"designing":[229],"case,":[236],"potentially":[238],"also":[239,250,272],"other":[241],"problems.":[243],"Additionally,":[244],"leverage":[246],"our":[247],"obtain":[251],"randomized":[253],"^{5/3}\\log":[256],"n),":[257],"O(\\varDelta":[258],"\\log":[260],"graphs":[270,283],"matches":[273],"[Brandt":[284],"al.;":[286],"STOC\u201916].":[287]},"counts_by_year":[],"updated_date":"2026-05-26T06:15:08.310788","created_date":"2025-10-10T00:00:00"}