Structural parameterizations of budgeted graph coloring

We introduce a variant of the graph coloring problem, which we denote as Budgeted Coloring Problem (BCP). Given a graph G, an integer c and an ordered list of integers (b1,b2,…,bc), BCP asks whether there exists a proper coloring of G where the i-th color is used to color at most bi many vertices. T...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 940; s. 209 - 221
Hlavní autori:	Bandopadhyay, Susobhan, Banerjee, Suman, Banik, Aritra, Raman, Venkatesh
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 09.01.2023
Predmet:	Exact exponential algorithm Graph coloring Parameterized complexity Exact exponential algorithm Parameterized complexity Graph coloring
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!