Independent sets in (P-6, diamond)-free graphs
We prove that on the class of (P-6, diamond)-free graphs the Maximum-Weight Independent Set problem and the Minimum-Weight Independent Dominating Set problem can be solved in polynomial time.
maximum-weight independent set minimum-weight independent dominating set polynomial-time algorithm