Maximum Weight Independent Sets in hole- and co-chair-free graphs

Authors:
Andreas BrandstäDt;Vassilis Giakoumakis
Affiliations:
Fachbereich Informatik, Universität Rostock, A.-Einstein-Str. 22, D-18051 Rostock, Germany;MIS (Modélisation, Information & Systèèmes), Université de Picardie Jules Verne, Amiens, France
Venue:
Information Processing Letters
Year:
2012

Citing 11
Cited 3

Finding large holes

Information Processing Letters
Algorithms for weakly triangulated graphs

Discrete Applied Mathematics
A characterization of some graphs classes with no long holes

Journal of Combinatorial Theory Series B
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs

Information Processing Letters
Graph classes: a survey

Graph classes: a survey
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
Weakly chordal graph algorithms via handles

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Recognizing weakly triangulated graphs by edge separability

Nordic Journal of Computing
On the structure and stability number of P5- and co-chair-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem

Theoretical Computer Science
On Independent Vertex Sets in Subclasses of Apple-Free Graphs

Algorithmica

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

Discrete Applied Mathematics
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem

Theoretical Computer Science
Distance-$$d$$ independent set problems for bipartite and chordal graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a chordless cycle of length at least five). By applying a combination of clique separator and modular decomposition, we obtain a polynomial time solution of MWIS for hole- and co-chair-free graphs (the co-chair consists of five vertices four of which form a clique minus one edge - a diamond - and the fifth has degree one and is adjacent to one of the degree two vertices of the diamond).