Pages that link to "Item:Q6160119"
From MaRDI portal
The following pages link to A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119):
Displaying 6 items.
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- On the facets of the lift-and-project relaxations of graph subdivisions (Q2840709) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- On different versions of the exact subgraph hierarchy for the stable set problem (Q6585245) (← links)