Pages that link to "Item:Q3563008"
From MaRDI portal
The following pages link to On the Power of Nodes of Degree Four in the Local Max-Cut Problem (Q3563008):
Displayed 5 items.
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Computing Stable Outcomes in Hedonic Games (Q3162517) (← links)
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games (Q5108232) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
