{"date_published":"2018-01-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"page":"1 - 20","status":"public","publisher":"Society for Industrial and Applied Mathematics","year":"2018","day":"01","external_id":{"arxiv":["1711.04355"]},"citation":{"ieee":"S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2018, pp. 1–20.","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20.","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms for graph coloring. In: <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2018:1-20. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.1\">10.1137/1.9781611975031.1</a>","mla":"Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2018, pp. 1–20, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.1\">10.1137/1.9781611975031.1</a>.","apa":"Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., &#38; Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975031.1\">https://doi.org/10.1137/1.9781611975031.1</a>","ista":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon Nanongkai. “Dynamic Algorithms for Graph Coloring.” In <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1–20. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.1\">https://doi.org/10.1137/1.9781611975031.1</a>."},"date_created":"2022-08-16T12:07:14Z","month":"01","article_processing_charge":"No","publication_status":"published","publication":"29th Annual ACM-SIAM Symposium on Discrete Algorithms","abstract":[{"lang":"eng","text":"We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with  worst-case update time [4]."}],"oa_version":"Preprint","author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"last_name":"Chakrabarty","full_name":"Chakrabarty, Deeparnab","first_name":"Deeparnab"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"doi":"10.1137/1.9781611975031.1","conference":{"end_date":"2018-01-10","start_date":"2018-01-07","location":"New Orleans, LA, United States","name":"SODA: Symposium on Discrete Algorithms"},"_id":"11872","main_file_link":[{"url":"https://arxiv.org/abs/1711.04355","open_access":"1"}],"title":"Dynamic algorithms for graph coloring","quality_controlled":"1","scopus_import":"1","publication_identifier":{"eisbn":["978-161197503-1"]},"language":[{"iso":"eng"}],"date_updated":"2023-02-17T11:39:01Z","type":"conference","extern":"1"}