A polynomially computable upper bound for the weighted independence number of a graph is studied. This gives rise to a convex body containing the vertex packing polytope of the graph. This body is a polytope if and only if the graph is perfect. As an application of these notions, we show that the maximum weight independent set of an h-perfect graph can be found in polynomial time.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics