New results for recognizing convex-QP adverse graphs

DOI10.1080/02331934.2018.1556664zbMath1435.90139OpenAlexW2913614568MaRDI QIDQ5207738

Carlos J. Luz

Publication date: 13 January 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2018.1556664

zbMATH Keywords

combinatorial optimizationgraph theoryconvex quadratic programming in graphsmaximum stable set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Uses Software

• Octave

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
• An upper bound on the independence number of a graph computable in polynomial-time
• Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
• On the Shannon capacity of a graph
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• A Convex Quadratic Characterization of the Lovász Theta Number
• A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs

This page was built for publication: New results for recognizing convex-QP adverse graphs