Parameterized and Exact Algorithms for Class Domination Coloring

DOI10.1007/978-3-319-51963-0_26zbMath1444.68147arXiv2203.09106MaRDI QIDQ2971145

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

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.09106

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization