Skip to Main content Skip to Navigation
Journal articles

Independent sets in (P₆, diamond)-free graphs

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [47 references]  Display  Hide  Download

https://hal.inria.fr/hal-00988179
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, May 7, 2014 - 3:36:40 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:21 AM
Long-term archiving on: : Thursday, August 7, 2014 - 11:31:21 AM

File

509-4151-2-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00988179, version 1

Collections

Citation

Raffaele Mosca. Independent sets in (P₆, diamond)-free graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (1), pp.125--140. ⟨hal-00988179⟩

Share

Metrics

Record views

387

Files downloads

957