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

DOI10.1007/S10878-014-9745-XzbMATH Open1360.90255OpenAlexW2075204524MaRDI QIDQ5963623FDOQ5963623

Carlos J. Luz, D. M. Cardoso

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On standard quadratic optimization problems
• 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.
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
• Improving an upper bound on the stability number of a graph
• A surprising property of the least eigenvalue of a graph

Cited In (6)

• The main vertices of a star set and related graph parameters
• 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
• New results for recognizing convex-QP adverse graphs

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)