Pages that link to "Item:Q2181211"

The following pages link to A class of spectral bounds for max \(k\)-cut (Q2181211):

Displaying 14 items.

• Sharp spectral bounds of several graph parameters using eigenvector norms (Q286136) (← links)
• Max \(k\)-cut and the smallest eigenvalue (Q286169) (← 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)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• On spectral bounds for cutsets (Q1849996) (← 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)
• On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem (Q2685391) (← links)
• Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning (Q3453578) (← links)
• Spectral bounds for the maximum cut problem (Q3632965) (← links)
• (Q4558957) (← links)
• Optimal Bounds for the <i>k</i> -cut Problem (Q5066939) (← links)
• Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)