{"id":"https://openalex.org/W4214847522","doi":"https://doi.org/10.1145/3494539","title":"Fully Dynamic (\u0394 +1)-Coloring in <i>O</i> (1) Update Time","display_name":"Fully Dynamic (\u0394 +1)-Coloring in <i>O</i> (1) Update Time","publication_year":2022,"publication_date":"2022-03-04","ids":{"openalex":"https://openalex.org/W4214847522","doi":"https://doi.org/10.1145/3494539"},"language":"en","primary_location":{"id":"doi:10.1145/3494539","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3494539","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103251160","display_name":"Sayan Bhattacharya","orcid":"https://orcid.org/0000-0003-1612-0296"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sayan Bhattacharya","raw_affiliation_strings":["University of Warwick, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["IDSIA, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDSIA, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043137436","display_name":"Janardhan Kulkarni","orcid":"https://orcid.org/0009-0005-9980-7836"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Janardhan Kulkarni","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070332039","display_name":"Quanquan C. Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I4405258931","display_name":"MIT Computer Science and Artificial Intelligence Laboratory","ror":"https://ror.org/01e85r662","country_code":"US","type":"facility","lineage":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Quanquan C. Liu","raw_affiliation_strings":["MIT CSAIL, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT CSAIL, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4405258931"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084685735","display_name":"Shay Solomon","orcid":"https://orcid.org/0000-0003-2254-5100"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Solomon","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8622,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74908368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"2","first_page":"1","last_page":"25"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9936000108718872,"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/combinatorics","display_name":"Combinatorics","score":0.6976225972175598},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6611688733100891},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6580222845077515},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5702032446861267},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5328783392906189},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.5106211304664612},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5098292231559753},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5042680501937866},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4487728178501129},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43675553798675537},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43282386660575867},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.4153793156147003},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4089178740978241},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14233094453811646},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10487672686576843}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6976225972175598},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6611688733100891},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6580222845077515},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5702032446861267},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5328783392906189},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.5106211304664612},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5098292231559753},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5042680501937866},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4487728178501129},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43675553798675537},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43282386660575867},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.4153793156147003},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4089178740978241},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14233094453811646},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10487672686576843},{"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/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.1145/3494539","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3494539","pdf_url":null,"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:wrap.warwick.ac.uk:163819","is_oa":false,"landing_page_url":"https://wrap.warwick.ac.uk/163819/2/dcs-140322-wrap--copyright.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3947296455","display_name":"Theory and Applications of Dynamic Algorithms","funder_award_id":"EP/S03353X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6439267804","display_name":null,"funder_award_id":"EP/S03353X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6968301837","display_name":null,"funder_award_id":"1991/1","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1483324665","https://openalex.org/W1991755800","https://openalex.org/W2022155283","https://openalex.org/W2032950184","https://openalex.org/W2058422149","https://openalex.org/W2065826935","https://openalex.org/W2070790034","https://openalex.org/W2088330156","https://openalex.org/W2091919917","https://openalex.org/W2094224753","https://openalex.org/W2100061495","https://openalex.org/W2103715966","https://openalex.org/W2178621981","https://openalex.org/W2258655453","https://openalex.org/W2546514055","https://openalex.org/W2550458906","https://openalex.org/W2600945321","https://openalex.org/W2610183793","https://openalex.org/W2946990172","https://openalex.org/W2951652158","https://openalex.org/W2962761621","https://openalex.org/W2964007887","https://openalex.org/W2968066320","https://openalex.org/W3007586068","https://openalex.org/W3164033505","https://openalex.org/W4240084004","https://openalex.org/W4287865042","https://openalex.org/W4288364039","https://openalex.org/W6753681406","https://openalex.org/W6947900973"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4297911588","https://openalex.org/W2793500002","https://openalex.org/W4291316360","https://openalex.org/W2046652778","https://openalex.org/W4294957130","https://openalex.org/W2585997002","https://openalex.org/W151506147","https://openalex.org/W3169197204","https://openalex.org/W2094908956"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,8,115],"(\u0394":[3,50,70,127],"+1)-vertex":[4],"coloring":[5],"a":[6,44,49,104],"graph":[7],"maximum":[9],"degree":[10],"\u0394":[11],"has":[12],"been":[13],"extremely":[14],"well":[15],"studied":[16],"over":[17],"the":[18,27,98,113,123],"years":[19],"in":[20,87,137],"various":[21],"settings":[22],"and":[23,41,79,126,140],"models.":[24],"Surprisingly,":[25],"for":[26,47,69,102],"dynamic":[28],"setting,":[29],"almost":[30],"nothing":[31],"was":[32],"known":[33],"until":[34],"recently.":[35],"In":[36,60],"SODA\u201918,":[37],"Bhattacharya,":[38],"Chakrabarty,":[39],"Henzinger":[40],"Nanongkai":[42],"devised":[43],"randomized":[45,67,100],"algorithm":[46,68,101],"maintaining":[48,103],"+1)-coloring":[51,71,128],"with":[52,91],"O":[53,74],"(log":[54],"\u0394)":[55],"expected":[56],"amortized":[57,76],"update":[58,77],"time.":[59],"this":[61,82],"article,":[62],"we":[63,130],"present":[64],"an":[65],"improved":[66],"that":[72,81],"achieves":[73],"(1)":[75],"time":[78],"show":[80],"bound":[83],"holds":[84],"not":[85],"only":[86],"expectation":[88],"but":[89],"also":[90],"high":[92],"probability.":[93],"Our":[94],"starting":[95],"point":[96],"is":[97],"state-of-the-art":[99],"maximal":[105,124],"matching":[106,125],"(Solomon,":[107],"FOCS\u201916).":[108],"We":[109],"carefully":[110],"build":[111],"on":[112],"approach":[114],"Solomon,":[116],"but,":[117],"due":[118],"to":[119,132],"inherent":[120],"differences":[121],"between":[122],"problems,":[129],"need":[131],"deviate":[133],"significantly":[134],"from":[135],"it":[136],"several":[138],"crucial":[139],"highly":[141],"nontrivial":[142],"points.":[143],"1":[144]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T08:27:34.040176","created_date":"2022-03-05T00:00:00"}