On the parameterized complexity of happy vertex coloring

DOI10.1007/978-3-319-78825-8_9MaRDI QIDQ1642688zbMATH OpenOpenAlexFDO

Authors Akanksha Agrawal

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78825-8_9

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The parameterized complexity of happy colorings
• Parameterized complexity of happy coloring problems
• Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
• Parameterized algorithms for the happy set problem
• Kernelization for maximum happy vertices problem

Cited in

(15)

• Finding happiness: an analysis of the maximum happy vertices problem
• The parameterized complexity of happy colorings
• Graph classes and approximability of the happy set problem
• Tackling the maximum happy vertices problem in large networks
• A simple and effective algorithm for the maximum happy vertices problem
• Parameterized complexity of happy coloring problems
• Kernelization for maximum happy vertices problem
• On happy colorings, cuts, and structural parameterizations
• Complexity and approximability of the happy set problem
• Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
• Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
• Parameterized algorithms for the happy set problem
• 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
• Parameterized algorithms for the happy set problem

This page was built for publication: On the parameterized complexity of happy vertex coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642688)