Grundy Coloring and Friends, Half-Graphs, Bicliques

The first-fit coloring is a heuristic that assigns to each vertex, arriving in a specified order σ , the smallest available color. The problem Grundy Coloring asks how many colors are needed for the most adversarial vertex ordering σ , i.e., the maximum number of colors that the first-fit coloring r...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 85; H. 1; S. 1 - 28
Hauptverfasser:	Aboulker, Pierre, Bonnet, Édouard, Kim, Eun Jung, Sikora, Florian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2023 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Color Coloring Combinatorial analysis Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graphs Mathematics of Computing Parameterization Questions Theory of Computation ETH lower bounds free graphs Grundy coloring Half-graphs Theory of computation → Fixed parameter tractability Theory of computation → Graph algorithms analysis Parameterized complexity
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!