Pages that link to "Item:Q1634084"
From MaRDI portal
The following pages link to Finding happiness: an analysis of the maximum happy vertices problem (Q1634084):
Displaying 11 items.
- 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)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
