Greedy algorithms for dynamic graph coloring

摘要

Many real life applications are subject to changes which can be modeled as dynamic graphs. In this paper, we are interested especially in the dynamic graph coloring. We focus on coloring using online algorithms and we propose new greedy approaches to solve it efficiently.