Parameterized and exact algorithms for class domination coloring
Lists
Only you see this
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.
BibTeX
@inproceedings{krithika2017parameterized,
author = {R. Krithika and Ashutosh Rai and Saket Saurabh and Prafullkumar Tale},
title = {{Parameterized and exact algorithms for class domination coloring}},
booktitle = {SOFSEM},
year = {2017},
doi = {10.1007/978-3-319-51963-0\_26},
}