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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 81; H. 4; S. 1319 - 1341
Hauptverfasser:	Barba, Luis, Cardinal, Jean, Korman, Matias, Langerman, Stefan, van Renssen, André, Roeloffzen, Marcel, Verdonschot, Sander
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2019 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!