Fully Dynamic (Δ+1)-Coloring in Constant Update Time

10/04/2019
by   Sayan Bhattacharya, et al.
0

The problem of (vertex) (Δ+1)-coloring a graph of maximum degree Δ has been extremely well-studied over the years in various settings and models. Surprisingly, for the dynamic setting, almost nothing was known until recently. In SODA'18, Bhattacharya, Chakrabarty, Henzinger and Nanongkai devised a randomized data structure for maintaining a (Δ+1)-coloring with O(logΔ) expected amortized update time. In this paper, we present a (Δ+1)-coloring data structure that achieves a constant amortized update time and show that this time bound holds not only in expectation but also with high probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/12/2017

Dynamic Algorithms for Graph Coloring

We design fast dynamic algorithms for proper vertex and edge colorings i...
02/24/2020

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Graph coloring is a fundamental problem in computer science. We study th...
09/17/2019

Dynamic coloring for Bipartite and General Graphs

We consider the dynamic coloring problem on bipartite and general graphs...
07/13/2021

Maintaining 𝖢𝖬𝖲𝖮_2 properties on dynamic structures with bounded feedback vertex number

Let φ be a sentence of 𝖢𝖬𝖲𝖮_2 (monadic second-order logic with quantific...
04/29/2019

Improved Dynamic Graph Coloring

This paper studies the fundamental problem of graph coloring in fully dy...
11/01/2021

Online Edge Coloring via Tree Recurrences and Correlation Decay

We give an online algorithm that with high probability computes a (e/e-1...