Title of article
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time
Author/Authors
Andreas Brandst?dt، نويسنده , , Suhail Mahfud، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2002
Pages
9
From page
251
To page
259
Keywords
modular decomposition , Prime graphs , Clique width of graphs , Linear time , Monadic Second Order Logic , Algorithms , Modules in graphs , computational complexity , Maximum Stable Set
Journal title
Information Processing Letters
Serial Year
2002
Journal title
Information Processing Letters
Record number
129616
Link To Document