Polynomial Algorithms for Perfect Graphs

  • Published 2005


We show that the weighted versions of the stable set problem, the clique problem, the coloring problem and the clique covering problem are solvable in polynomial time for perfect graphs. Our algorithms are based on the ellipsoid method and a polynomial time separation algorithm for a certain class of positive semidefinite matrices related to Lovasz's bound… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics