par Barba Flores, Luis 
;Cardinal, Jean ;Korman, Matias ;Langerman, Stefan ;Van Renssen, André;Roeloffzen, Marcel;Verdonschot, Sander
Référence Lecture notes in computer science, 10389 LNCS, page (97-108)
Publication Publié, 2017
;Cardinal, Jean ;Korman, Matias ;Langerman, Stefan ;Van Renssen, André;Roeloffzen, Marcel;Verdonschot, SanderRéférence Lecture notes in computer science, 10389 LNCS, page (97-108)
Publication Publié, 2017
Article révisé par les pairs
| Résumé : | 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 edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any d > 0, the first algorithm maintains a proper O(CdN1/d)-coloring while recoloring at most O(d) vertices per update, where C and N are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses the trade-off, maintaining an O(Cd)-coloring with O(dN1/d) recolorings per update. We also present a lower bound, showing that any algorithm that maintains a c-coloring of a 2-colorable graph on N vertices must recolor at least Ω(N 2/ c(c−1)) vertices per update, for any constant c ≥ 2. |
