Improving an upper bound on the stability number of a graph

DOI10.1007/s10898-004-6536-4zbMath1071.90038OpenAlexW2021053327MaRDI QIDQ556012

Carlos J. Luz

Publication date: 13 June 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-6536-4

zbMATH Keywords

quadratic programmingcombinatorial optimizationgraph theorymaximum stable set

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs ⋮ A survey on graphs with convex quadratic stability number

Cites Work

• Unnamed Item
• Unnamed Item
• On hereditary properties of the class of graphs with convex quadratic stability number
• Geometric algorithms and combinatorial optimization
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
• On standard quadratic optimization problems
• Semidefinite programming in combinatorial optimization
• Interlacing eigenvalues and graphs
• An upper bound on the independence number of a graph computable in polynomial-time
• Matrix Analysis
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Shannon capacity of a graph
• Continuous Characterizations of the Maximum Clique Problem
• Maxima for Graphs and a New Proof of a Theorem of Turán
• A quadratic programming approach to the determination of an upper bound on the weighted stability number
• Convex quadratic programming approach

This page was built for publication: Improving an upper bound on the stability number of a graph