Pages that link to "Item:Q286169"

The following pages link to Max \(k\)-cut and the smallest eigenvalue (Q286169):

Displaying 8 items.

• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
• Minimum cuts, girth and a spectral threshold (Q1029057) (← links)
• Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
• On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem (Q2685391) (← links)
• A spectral partitioning algorithm for maximum directed cut problem (Q5918387) (← links)
• Combinatorial upper bounds for the smallest eigenvalue of a graph (Q6564137) (← links)