Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2020) Constant-time dynamic (∆+1)-coloring. In: Paul, C. and Bläser, M., (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 10-13 Mar 2020, Montpellier, France. LIPIcs, 154 . Schloss Dagstuhl – Leibniz Center for Informatics , 53:1-53:18. ISBN 9783959771405
Abstract
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). 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.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2020 Monika Henzinger and Pan Peng; licensed under Creative Commons License CC-BY. (https://creativecommons.org/licenses/by/3.0/) |
Keywords: | Dynamic graph algorithms; Graph coloring; Random sampling |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 20 Jan 2020 12:48 |
Last Modified: | 20 Apr 2020 11:04 |
Status: | Published |
Publisher: | Schloss Dagstuhl – Leibniz Center for Informatics |
Series Name: | LIPIcs |
Refereed: | Yes |
Identification Number: | 10.4230/LIPIcs.STACS.2020.53 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:155695 |