Pages that link to "Item:Q2081605"
From MaRDI portal
The following pages link to Maximizing happiness in graphs of bounded clique-width (Q2081605):
Displaying 4 items.
- Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)