Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time

Andreas Brandst?dt، نويسنده , , Suhail Mahfud، نويسنده ,

دوهفته نامه با شماره پیاپی سال 2002

9

251

259

modular decomposition , Prime graphs , Clique width of graphs , Linear time , Monadic Second Order Logic , Algorithms , Modules in graphs , computational complexity , Maximum Stable Set

Information Processing Letters

2002

Information Processing Letters

129616