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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 81; číslo 4; s. 1319 - 1341
Hlavní autori:	Barba, Luis, Cardinal, Jean, Korman, Matias, Langerman, Stefan, van Renssen, André, Roeloffzen, Marcel, Verdonschot, Sander
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!