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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 85; číslo 1; s. 1 - 28
Hlavní autori:	Aboulker, Pierre, Bonnet, Édouard, Kim, Eun Jung, Sikora, Florian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2023 Springer Nature B.V Springer Verlag
Predmet:	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
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!