Pages that link to "Item:Q4910584"

The following pages link to Max Cut and the Smallest Eigenvalue (Q4910584):

Displaying 33 items.

• Sharp spectral bounds of several graph parameters using eigenvector norms (Q286136) (← links)
• Max \(k\)-cut and the smallest eigenvalue (Q286169) (← links)
• Multi-way dual Cheeger constants and spectral bounds of graphs (Q471683) (← links)
• Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
• Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
• The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs (Q744112) (← links)
• Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
• Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
• Spectral clustering revisited: information hidden in the Fiedler vector (Q2072633) (← links)
• The product of two high-frequency graph Laplacian eigenfunctions is smooth (Q2111909) (← links)
• Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians (Q2112759) (← links)
• On the bipartiteness constant and expansion of Cayley graphs (Q2122675) (← links)
• On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
• Cheeger constants, structural balance, and spectral clustering analysis for signed graphs (Q2279269) (← links)
• Some observations on the smallest adjacency eigenvalue of a graph (Q2295999) (← links)
• Spectral distances on graphs (Q2352784) (← links)
• Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian (Q4619480) (← links)
• Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology (Q5053659) (← links)
• Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
• Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Q5075818) (← links)
• A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
• (Q5090928) (← links)
• (Q5158503) (← links)
• Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs (Q5268000) (← links)
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
• A spectral partitioning algorithm for maximum directed cut problem (Q5918387) (← links)
• Bipartite communities via spectral partitioning (Q5918521) (← links)
• Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians (Q5963604) (← links)
• A unified approach to synchronization problems over subgroups of the orthogonal group (Q6117023) (← links)
• Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
• Combinatorial upper bounds for the smallest eigenvalue of a graph (Q6564137) (← links)
• Max cut and semidefinite rank (Q6564284) (← links)
• An experimental evaluation of semidefinite programming and spectral algorithms for max cut (Q6579779) (← links)