A simplex like approach based on star sets for recognizing convex-QP adverse graphs

DOI10.1007/S10878-014-9745-XMaRDI QIDQ5963623zbMATH OpenOpenAlexFDO

Authors D. M. Cardoso, Carlos J. Luz

Publication date 23 February 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-014-9745-x

zbMATH Keywords

star setssimplex-like approachconvex quadratic programming in graphsgraphs with convex-\(QP\) stability number

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Programming involving graphs or networks (90C35)

Recommendations

• New results for recognizing convex-\(QP\) adverse graphs
• Recognition of Graphs with Convex Quadratic Stability Number
• A survey on graphs with convex quadratic stability number
• scientific article; zbMATH DE number 2096432
• Convex quadratic programming approach

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
• A surprising property of the least eigenvalue of a graph
• An introduction to the theory of graph spectra
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• An upper bound on the independence number of a graph computable in polynomial-time
• Finding independent sets in a graph using continuous multivariable polynomial formulations.
• Improving an upper bound on the stability number of a graph
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On standard quadratic optimization problems

Cited in

(7)

• The main vertices of a star set and related graph parameters
• New results for recognizing convex-\(QP\) adverse graphs
• scientific article; zbMATH DE number 2096432 (Why is no real title available?)
• A survey on graphs with convex quadratic stability number
• A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming
• Efficient domination through eigenvalues
• A characterization of the weighted Lovász number based on convex quadratic programming

This page was built for publication: A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963623)