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 …

A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply
recomputing it from scratch in O (m) time after each update. But can it be maintained in time …

This article studies the fundamental problem of graph coloring in fully dynamic graphs. Since
the problem of computing an optimal coloring, or even approximating it to within n1-ε for any …

We study the problem of coloring a given graph using a small number of colors in several
well-established models of computation for big data. These include the data streaming …

In this paper, we revisit the online recoloring problem introduced recently by Azar et al. In
online recoloring, there is a fixed set $ V $ of $ n $ vertices and an initial coloring $ c_0 …

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 …

Dynamic environments are still a big challenge for optimization algorithms. In this paper, a
Genetic Algorithm using both Multiploid representation and the Bayesian Decision method is …

We contribute to the theoretical understanding of randomized search heuristics for dynamic
problems. We consider the classical graph coloring problem and investigate the dynamic …

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 initiate the study of the vertex coloring problem of a graph in the semi
streaming model. In this model, the input graph is defined by a stream of edges, arriving in …