Pages that link to "Item:Q2196300"
From MaRDI portal
The following pages link to A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300):
Displaying 5 items.
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)
