Pages that link to "Item:Q501003"
From MaRDI portal
The following pages link to Algorithmic aspects of homophyly of networks (Q501003):
Displayed 7 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)
- Approximation algorithms for vertex happiness (Q2326078) (← 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)