Pages that link to "Item:Q556012"
From MaRDI portal
The following pages link to Improving an upper bound on the stability number of a graph (Q556012):
Displaying 8 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)
- Improving upper bounds for the clique number by non-valid inequalities (Q2340341) (← links)
- A note on the stability number of an orthogonality graph (Q2643845) (← links)
- Graphs with least eigenvalue \(-2\) attaining a convex quadratic upper bound for the stability number (Q2914024) (← links)
- A survey on graphs with convex quadratic stability number (Q5207733) (← links)
- A Convex Quadratic Characterization of the Lovász Theta Number (Q5470766) (← links)
- A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs (Q5963623) (← links)