scholarly journals Independent Sets of Maximum Weight in Apple-Free Graphs

2010 ◽  
Vol 24 (1) ◽  
pp. 239-254 ◽  
Author(s):  
Andreas Brandstädt ◽  
Vadim V. Lozin ◽  
Raffaele Mosca
Keyword(s):  
Independent Sets ◽  
Maximum Weight

scholarly journals Maximum weight independent sets in classes related to claw-free graphs

2017 ◽  
Vol 216 ◽  
pp. 233-239 ◽  
Author(s):  
T. Karthick ◽  
Frédéric Maffray
Keyword(s):  
Independent Sets ◽  
Maximum Weight

scholarly journals Independent sets of maximum weight in (p,q)-colorable graphs

2003 ◽  
Vol 265 (1-3) ◽  
pp. 351-356 ◽  
Author(s):  
Vladimir E. Alekseev ◽  
Vadim V. Lozin
Keyword(s):  
Independent Sets ◽  
Maximum Weight

scholarly journals Maximum weight independent sets in hole- and dart-free graphs

2012 ◽  
Vol 160 (16-17) ◽  
pp. 2364-2369 ◽  
Author(s):  
M. Basavaraju ◽  
L.S. Chandran ◽  
T. Karthick
Keyword(s):  
Independent Sets ◽  
Maximum Weight

scholarly journals Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull

2014 ◽  
Vol 31 (5) ◽  
pp. 1249-1262 ◽  
Author(s):  
Andreas Brandstädt ◽  
Raffaele Mosca
Keyword(s):  
Independent Sets ◽  
Maximum Weight

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

2009 ◽  
Vol Vol. 11 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Raffaele Mosca
Keyword(s):  
Polynomial Time ◽  
Dominating Set ◽  
Minimum Weight ◽  
Independent Set ◽  
Independent Sets ◽  
Maximum Weight ◽  
Independent Set Problem ◽  
International Audience ◽  
Dominating Set Problem ◽  
Independent Dominating Set

Graphs and Algorithms International audience 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.

Sign in / Sign up

Export Citation Format

Share Document