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

research
11/12/2017

Dynamic Algorithms for Graph Coloring

We design fast dynamic algorithms for proper vertex and edge colorings i...
research
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...
research
07/21/2020

Breaking the 2^n barrier for 5-coloring and 6-coloring

The coloring problem (i.e., computing the chromatic number of a graph) c...
research
02/11/2023

A Simple Data Structure for Maintaining a Discrete Probability Distribution

We revisit the following problem: given a set of indices S = {1, …, n} a...
research
07/10/2019

Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing

With few exceptions (namely, algorithms for maximal matching, 2-approxim...
research
09/17/2019

Dynamic coloring for Bipartite and General Graphs

We consider the dynamic coloring problem on bipartite and general graphs...
research
04/29/2019

Improved Dynamic Graph Coloring

This paper studies the fundamental problem of graph coloring in fully dy...

Please sign up or login with your details

Forgot password? Click here to reset