{"_id":"11662","status":"public","volume":18,"publication_status":"published","quality_controlled":"1","issue":"2","article_processing_charge":"No","type":"journal_article","date_published":"2022-03-04T00:00:00Z","title":"Constant-time Dynamic (Δ +1)-Coloring","scopus_import":"1","date_created":"2022-07-27T10:58:53Z","acknowledgement":"We want to thank an anonymous referee who pointed out a mistake in our conference paper as well as suggesting a fix using an approach in References.","article_number":"16","citation":{"short":"M.H. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022).","apa":"Henzinger, M. H., &#38; Peng, P. (2022). Constant-time Dynamic (Δ +1)-Coloring. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery (ACM). <a href=\"https://doi.org/10.1145/3501403\">https://doi.org/10.1145/3501403</a>","mla":"Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic (Δ +1)-Coloring.” <i>ACM Transactions on Algorithms</i>, vol. 18, no. 2, 16, Association for Computing Machinery (ACM), 2022, doi:<a href=\"https://doi.org/10.1145/3501403\">10.1145/3501403</a>.","ista":"Henzinger MH, Peng P. 2022. Constant-time Dynamic (Δ +1)-Coloring. ACM Transactions on Algorithms. 18(2), 16.","ieee":"M. H. Henzinger and P. Peng, “Constant-time Dynamic (Δ +1)-Coloring,” <i>ACM Transactions on Algorithms</i>, vol. 18, no. 2. Association for Computing Machinery (ACM), 2022.","ama":"Henzinger MH, Peng P. Constant-time Dynamic (Δ +1)-Coloring. <i>ACM Transactions on Algorithms</i>. 2022;18(2). doi:<a href=\"https://doi.org/10.1145/3501403\">10.1145/3501403</a>","chicago":"Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic (Δ +1)-Coloring.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery (ACM), 2022. <a href=\"https://doi.org/10.1145/3501403\">https://doi.org/10.1145/3501403</a>."},"author":[{"orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"}],"month":"03","year":"2022","language":[{"iso":"eng"}],"extern":"1","date_updated":"2022-07-27T11:08:13Z","day":"04","intvolume":"        18","publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"article_type":"original","publication":"ACM Transactions on Algorithms","doi":"10.1145/3501403","oa_version":"None","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","publisher":"Association for Computing Machinery (ACM)","abstract":[{"text":"We give a fully dynamic (Las-Vegas style) algorithm with constant expected amortized time per update that maintains a proper (Δ +1)-vertex coloring of a graph with maximum degree at most Δ. This improves upon the previous O(log Δ)-time algorithm by Bhattacharya et al. (SODA 2018). Our algorithm uses an approach based on assigning random ranks to vertices and does not need to maintain a hierarchical graph decomposition. We show that our result does not only have optimal running time but is also optimal in the sense that already deciding whether a Δ-coloring exists in a dynamically changing graph with maximum degree at most Δ takes Ω (log n) time per operation.","lang":"eng"}]}