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

• Published in: arXiv.org
• Main Authors: Brandstädt, Andreas, Mosca, Raffaele
• Format: Paper
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 12.09.2012
• Subjects: Apexes; Decomposition; Graph theory; Graphs; Polynomials; Separators; Weight

The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexit...