The parameterized complexity of happy colorings
From MaRDI portal
Publication:1642692
DOI10.1007/978-3-319-78825-8_12zbMath1454.68113arXiv1708.03853OpenAlexW2747291630MaRDI QIDQ1642692
Neeldhara Misra, I. Vinod Reddy
Publication date: 15 June 2018
Full work available at URL: https://arxiv.org/abs/1708.03853
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (4)
Finding happiness: an analysis of the maximum happy vertices problem ⋮ Parameterized complexity of happy coloring problems ⋮ Parameterized algorithms for the happy set problem ⋮ Lower bounds for the happy coloring problems
This page was built for publication: The parameterized complexity of happy colorings
