Pages that link to "Item:Q2123126"
From MaRDI portal
The following pages link to An SDP-based approach for computing the stability number of a graph (Q2123126):
Displaying 6 items.
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- LP-oriented upper bounds for the weighted stability number of a graph (Q1040359) (← links)
- Maximum stable set formulations and heuristics based on continuous optimization (Q1396818) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Bounds on the Stability Number of a Graph via the Inverse Theta Function (Q2973236) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)