Parameterized and exact algorithms for class domination coloring

Open Webpage

R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale

Published: 2021, Last Modified: 13 May 2025Discret. Appl. Math. 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•An exact algorithm that runs in time O(2nn4logn).•An FPT algorithm parameterized by the number of colors and the treewidth.•FPT algorithms when input graph is restricted to special graph classes.•3-cd-Coloring is FPT parameterized by the solution size.