P5-free augmenting graphs and the maximum stable set problem

Authors:
Michael U. Gerber;Alain Hertz;David Schindl
Affiliations:
Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland;Département de Mathématiques et de Génie Industriel, GERAD and Ecole Polytechnique, 3000 Chemin de la Côte-Sainte-Catherine, Montreal, Canada H3C 3A7;Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland
Venue:
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Year:
2003

Citing 9
Cited 7

Quasi-threshold graphs

Discrete Applied Mathematics
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs

Information Processing Letters
Weighted parameters in (P5,&Pmacr;5)-free graphs

Discrete Applied Mathematics
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
Stable sets in certain P6-free graphs

Discrete Applied Mathematics
A note on &agr;-redundant vertices in graphs

Discrete Applied Mathematics
On the stable set problem in special P5-free graphs

Discrete Applied Mathematics
Stable sets in two subclasses of banner-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Augmenting graphs for independent sets

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)

Finding augmenting chains in extensions of claw-free graphs

Information Processing Letters
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
New applications of clique separator decomposition for the Maximum Weight Stable Set problem

Theoretical Computer Science
Maximum independent sets in subclasses of P5-free graphs

Information Processing Letters
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
Practical computation of optimal schedules in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
New applications of clique separator decomposition for the maximum weight stable set problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity status of the maximum stable set problem in the class of P5-free graphs is unknown. In this paper, we first propose a characterization of all connected P5-free augmenting graphs. We then use this characterization to detect families of subclasses of P5-free graphs where the maximum stable set problem has a polynomial time solution. These families extend several previously studied classes.