Dynamic Graph Coloring

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 numbe...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 81; no. 4; pp. 1319 - 1341
Main Authors:	Barba, Luis, Cardinal, Jean, Korman, Matias, Langerman, Stefan, van Renssen, André, Roeloffzen, Marcel, Verdonschot, Sander
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2019 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Graph coloring Graph theory Lower bounds Mathematics of Computing Theory of Computation Tradeoffs Dynamic coloring Graphs Data structures Amortized algorithms
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!