| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [47 references]
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
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)