Title of article
Some results on maximum stable sets in certain P5-free graphs Original Research Article
Author/Authors
Raffaele Mosca، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
9
From page
175
To page
183
Abstract
We introduce some large classes of P5-free graphs for which the maximum stable set problem can be efficiently solved. The solution algorithms are based on the search of augmenting vertices. Then a method for extending some of them to the weighted case is provided.
Keywords
Stable set , Computational complexity
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885729
Link To Document