On the parameterized complexity of happy vertex coloring
From MaRDI portal
Publication:1642688
DOI10.1007/978-3-319-78825-8_9zbMath1454.68087OpenAlexW2798594944MaRDI QIDQ1642688
Publication date: 15 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_9
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (10)
A simple and effective algorithm for the maximum happy vertices problem ⋮ Finding happiness: an analysis of the maximum happy vertices problem ⋮ Complexity and approximability of the happy set problem ⋮ Parameterized complexity of happy coloring problems ⋮ Parameterized algorithms for the happy set problem ⋮ Graph classes and approximability of the happy set problem ⋮ Tackling the maximum happy vertices problem in large networks ⋮ Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph ⋮ Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph ⋮ Lower bounds for the happy coloring problems
This page was built for publication: On the parameterized complexity of happy vertex coloring
