Dynamic Edge Coloring of Forests

Abstract

In the \emph{dynamic edge coloring} problem, one has to maintain a graph of maximum degree $\hat{I}”$ with at most $\hat{I}”+c$ colors, under edge updates. A prominent objective is to minimize the \emph{recourse}, namely the number of edges that are recolored. We study this problem on forests, arguably the simplest graph class that already captures much of the complexity of the problem. We consider both the \emph{incremental} model, where edges are only inserted and the \emph{fully dynamic} model where edges may also be deleted. In the deterministic setting, we focus on the natural greedy algorithm. We show that it achieves $O(\frac{1}{c+\sqrt{\hat{I}}”})$ amortized recourse in the incremental model, and that this is tight up to tie-breaking. In contrast, in a fully dynamic forest, greedy can be forced to have $\hat{I}\text{c◯}({\log }_{\hat{I}}”n)$ amortized recourse. To partially overcome this limitation of greedy within the deterministic setting, we give an optimal non-greedy algorithm with $O(1)$ amortized recourse for \emph{rooted} fully dynamic forests and $c=\hat{I}”-2$. In the randomized setting, we give a natural distribution-maintaining algorithm. In the incremental model, it achieves $\hat{I}˜(\frac{1}{\hat{I}}”)$ expected amortized recourse, and we show that this is optimal for every constant $c$. In the fully dynamic model, the same algorithm achieves $\hat{I}˜(\min \{\frac{\hat{I}}{”}c,{\log }_{\hat{I}}”n\})$ expected recourse for $c>0$, and $\hat{I}˜({\log }_{\hat{I}}”n)$ for $c=0$. We show that this is optimal for $c=0$, and prove an $\hat{I}\text{c◯}(1)$ lower bound for every constant $c$.

Added randomized lower bounds for constant c, and running time analysis. Also, some revisions in presentation and phrasings