Pages that link to "Item:Q3632965"
From MaRDI portal
The following pages link to Spectral bounds for the maximum cut problem (Q3632965):
Displaying 13 items.
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- On spectral bounds for cutsets (Q1849996) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors (Q2419023) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- New bounds for the maximum cut problem (Q3439502) (← links)
- Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning (Q3453578) (← links)
