Max cut and the smallest eigenvalue
From MaRDI portal
Recommendations
Cited in
(48)- Laplacian eigenvalues and the maximum cut problem
- Simple approximation algorithms for balanced MAX~2SAT
- Spectral clustering revisited: information hidden in the Fiedler vector
- The product of two high-frequency graph Laplacian eigenfunctions is smooth
- Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
- On the bipartiteness constant and expansion of Cayley graphs
- On computational capabilities of Ising machines based on nonlinear oscillators
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
- Some observations on the smallest adjacency eigenvalue of a graph
- A max-cut approximation using a graph based MBO scheme
- Spectral distances on graphs
- Sharp spectral bounds of several graph parameters using eigenvector norms
- Max k-cut and the smallest eigenvalue
- Curvature and higher order Buser inequalities for the graph connection Laplacian
- Multi-way dual Cheeger constants and spectral bounds of graphs
- Bipartite Subgraphs and the Smallest Eigenvalue
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- Fast Distributed Approximation for Max-Cut
- Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem
- A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
- Adapting local sequential algorithms to the distributed setting
- Sherali-Adams strikes back
- Max CUT and the smallest eigenvalue
- Max-cut and extendability of matchings in distance-regular graphs
- Combinatorial algorithms for minimizing the maximum Laplacian and signless Laplacian eigenvalues of weighted graphs
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- A spectral partitioning algorithm for maximum directed cut problem
- Bipartite communities via spectral partitioning
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- A unified approach to synchronization problems over subgroups of the orthogonal group
- Robust Factorizations and Colorings of Tensor Graphs
- Combinatorial upper bounds for the smallest eigenvalue of a graph
- Max cut and semidefinite rank
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut
- Ricci curvature, diameter and eigenvalues of amply regular graphs
- Fully dynamic sequential and distributed algorithms for MAX-CUT
- A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem
- A sublinear time tester for max-cut on clusterable graphs
- Sparse cuts in hypergraphs from random walks on simplicial complexes
- Dual Cheeger constants, signless 1-Laplacians and maxcut
- Vertex isoperimetry on signed graphs and spectra of non-bipartite Cayley and Cayley sum graphs
- A simple iterative algorithm for maxcut
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Discrete Bakry-Émery curvature tensors and matrices of connection graphs
- Comparison of hyperplane rounding for max-cut and quantum approximate optimization algorithm over certain regular graph families
- Triangles improve 0.878 approximation for Maxcut
- O( n)-approximation algorithms for bipartiteness ratio
- The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs
This page was built for publication: Max cut and the smallest eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910584)
