Pages that link to "Item:Q2349129"
From MaRDI portal
The following pages link to Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129):
Displaying 13 items.
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- Graph bisection revisited (Q1657405) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- (Q4737533) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316491) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
