On the Power of Nodes of Degree Four in the Local Max-Cut Problem
From MaRDI portal
(Redirected from Publication:3563008)
Recommendations
- Local approximation of the maximum cut in regular graphs
- Local approximation of the maximum cut in regular graphs
- Node and edge relaxations of the max-cut problem
- Local improving algorithms for large cuts in graphs with maximum degree three
- Settling the complexity of local max-cut (almost) completely
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree
- On L-borderenergetic graphs with maximum degree at most 4
- A refined algorithm for maximum independent set in degree-4 graphs
- Weight choosability of graphs with maximum degree 4
- Approximating Minimum-Power Degree and Connectivity Problems
Cited in
(9)- Settling the complexity of local max-cut (almost) completely
- Computing Stable Outcomes in Hedonic Games
- Integer Linear Programs and Local Search for Max-Cut
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- Representing fitness landscapes by valued constraints to understand the complexity of local search
- Local approximation of the maximum cut in regular graphs
- Stability based on single-agent deviations in additively separable hedonic games
- The k-Opt algorithm for the traveling salesman problem has exponential running time for k 5
- Complexity of local search for Euclidean clustering problems
This page was built for publication: On the Power of Nodes of Degree Four in the Local Max-Cut Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563008)
