Gap, cosum and product properties of the ^ bound on the clique number
From MaRDI portal
Publication:3066919
Recommendations
Cites work
- A comparison of the Delsarte and Lovász bounds
- Approximation of the stability number of a graph via copositive programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- scientific article; zbMATH DE number 1384868 (Why is no real title available?)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On the Shannon capacity of a graph
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function
- Semidefinite programming relaxations for graph coloring and maximal clique problems
Cited in
(5)- Factorization and cutting planes for completely positive matrices by copositive projection
- Copositivity cuts for improving SDP bounds on the clique number
- A notion of total dual integrality for convex, semidefinite, and extended formulations
- Quadratic factorization heuristics for copositive programming
- A Sum of Squares Characterization of Perfect Graphs
This page was built for publication: Gap, cosum and product properties of the \(\theta ^{\prime}\) bound on the clique number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066919)