Local Max-Cut on sparse graphs
From MaRDI portal
Cites work
- Emergence of Scaling in Random Networks
- Faster sublinear approximation of the number of k-cliques in low-arboricity graphs
- How easy is local search?
- Improving the Smoothed Complexity of FLIP for Max Cut Problems
- Local max-cut in smoothed polynomial time
- Neural networks and physical systems with emergent collective computational abilities
- Settling the complexity of local max-cut (almost) completely
- Simple Local Search Problems that are Hard to Solve
- Smoothed analysis of algorithms
- Smoothed analysis of local search for the maximum-cut problem
- Smoothed complexity of local max-cut and binary max-CSP
- Testing bounded arboricity
- The complexity of pure Nash equilibria
This page was built for publication: Local Max-Cut on sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253168)
