Pages that link to "Item:Q2026712"
From MaRDI portal
The following pages link to Tackling the maximum happy vertices problem in large networks (Q2026712):
Displaying 4 items.
- Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
- Maximizing happiness in graphs of bounded clique-width (Q2081605) (← links)
- A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)