Pages that link to "Item:Q686456"
From MaRDI portal
The following pages link to The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456):
Displaying 16 items.
- Computing the Grothendieck constant of some graph classes (Q408441) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- On conjectures involving second largest signless Laplacian eigenvalue of graphs (Q967519) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- Simplicial faces of the set of correlation matrices (Q1991097) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- A survey of graph laplacians (Q4853923) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
