Pages that link to "Item:Q501003"

The following pages link to Algorithmic aspects of homophyly of networks (Q501003):

Displaying 17 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)
• Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← 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)
• Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
• Parameterized complexity of happy coloring problems (Q2192381) (← links)
• Approximation algorithms for vertex happiness (Q2326078) (← links)
• Complexity and approximability of the happy set problem (Q2662689) (← links)
• New algorithms for a simple measure of network partitioning (Q2700788) (← links)
• Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
• Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
• Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381) (← links)
• Happy set problem on subclasses of co-comparability graphs (Q6069926) (← links)
• On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)