Title of article :
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs
Author/Authors :
Raffaele Mosca، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1997
Pages :
7
From page :
137
To page :
143
Keywords :
Algorithms , Combinatorial problems , Computational camplexity , Stable set
Journal title :
Information Processing Letters
Serial Year :
1997
Journal title :
Information Processing Letters
Record number :
128625
Link To Document :
بازگشت