Pages that link to "Item:Q2819511"

The following pages link to Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511):

Displaying 11 items.

• Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
• Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Graph classes and approximability of the happy set problem (Q2019476) (← links)
• Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
• The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
• A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
• Parameterized complexity of happy coloring problems (Q2192381) (← links)
• Complexity and approximability of the happy set problem (Q2662689) (← links)
• Lower bounds for the happy coloring problems (Q5918935) (← links)
• Parameterized algorithms for the happy set problem (Q5919103) (← links)