Independent sets in P₆, diamond-free graphsReport as inadecuate

Independent sets in P₆, diamond-free graphs - Download this document for free, or read online. Document in PDF available to download.

1 Dipartimento di Scienze - Universita di Chieti-Pescara

Abstract : We prove that on the class of P6,diamond-free graphs the Maximum-Weight Independent Set problem and the Minimum-Weight Independent Dominating Set problem can be solved in polynomial time.

Author: Raffaele Mosca -



Related documents