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 …

Graph coloring is a fundamental graph problem that is widely applied in a variety of
applications. The aim of graph coloring is to minimize the number of colors used to color the …

Given an undirected simple graph G=(V, E) that undergoes edge insertions and deletions,
we wish to efficiently maintain an edge coloring with only a few colors. The previous best …

In this paper we study the number of vertex recolorings that an algorithm needs to perform in
order to maintain a proper coloring of a graph under insertion and deletion of vertices and …

In this paper we study the number of vertex recolorings that an algorithm needs to perform in
order to maintain a proper coloring of a graph under insertion and deletion of vertices and …

Data collection is the most basic application of sensor networks. Sensors are deployed in a
given region of interest. They sense some physical phenomenon and store the readings. All …

Many real-world operational research problems can be reformulated into static graph
colouring problems. However, such problems might be better represented as dynamic …

We consider the dynamic graph coloring problem restricted to the class of interval graphs. At
each update step the algorithm is presented with an interval to be colored, or a previously …

We consider the dynamic graph coloring problem restricted to the class of interval graphs. At
each update step the algorithm is presented with an interval to be colored, or a previously …

We consider the dynamic graph coloring problem restricted to the class of interval graphs in
the incremental and fully dynamic setting. The input consists of a sequence of intervals that …