Trade-Offs in Dynamic Coloring for Bipartite and General Graphs

The dynamic coloring problem has gained attention in the recent past. The focus has largely been on obtaining efficient update time algorithms using Δ + 1 or more colors and the trade-offs between update time and query time. Another important parameter in dynamic coloring is the number of recoloring...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 85; H. 4; S. 854 - 878
Hauptverfasser:	Kashyop, Manas Jyoti, Narayanaswamy, N. S., Nasre, Meghana, Potluri, Sai Mohith
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2023 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Coloring Computer Science Computer Systems Organization and Communication Networks Data structures Data Structures and Information Theory Graph theory Graphs Lower bounds Mathematics of Computing Theory of Computation Tradeoffs Graph coloring Dynamic graph algorithms
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!