Unique satisfiability of Horn sets can be solved in nearly linear time

Maximum Weight Stable Set on graphs with

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 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Minty has shown that the Maximum Weight Stable Set (MWS) Problem can be solved in polynomial time when restricted to claw-free graphs. We show that the structure of graphs being both claw-free and co-claw-free is very simple which implies bounded clique width for this graph class. It is known that f