A simplex like approach based on star sets for recognizing convex-QP adverse graphs
A graph G with convex-QP stability number (or simply a convex-QP graph) is a graph for which the stability number is equal to the optimal value of a convex quadratic program, say P(G). There are polynomial-time procedures to recognize convex-QP graphs, except when the graph G is adverse or contains...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/15192 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/15192 |