Max Cut and the Smallest Eigenvalue

Cited In (33)

Fast Distributed Approximation for Max-Cut
Combinatorial upper bounds for the smallest eigenvalue of a graph
Max cut and semidefinite rank
The product of two high-frequency graph Laplacian eigenfunctions is smooth
Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
An experimental evaluation of semidefinite programming and spectral algorithms for max cut
Max \(k\)-cut and the smallest eigenvalue
Sharp spectral bounds of several graph parameters using eigenvector norms
Simple approximation algorithms for balanced MAX~2SAT
Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs
Some observations on the smallest adjacency eigenvalue of a graph
Laplacian eigenvalues and the maximum cut problem
On the bipartiteness constant and expansion of Cayley graphs
Bipartite communities via spectral partitioning
On computational capabilities of Ising machines based on nonlinear oscillators
The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
Title not available (Why is that?)
Multi-way dual Cheeger constants and spectral bounds of graphs
Robust Factorizations and Colorings of Tensor Graphs
Title not available (Why is that?)
Spectral distances on graphs
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs
A spectral partitioning algorithm for maximum directed cut problem
Spectral clustering revisited: information hidden in the Fiedler vector
A unified approach to synchronization problems over subgroups of the orthogonal group
Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem
Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian
Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
Max-cut and extendability of matchings in distance-regular 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)