✦ LIBER ✦

Faster algorithms for vertex partitioning problems parameterized by clique-width

✍ Scribed by Oum, Sang-il; Sæther, Sigve Hortemo; Vatshelle, Martin

Book ID: 122110176
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 315 KB
Volume: 535
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.03.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for vertex-partitioning probl

Algorithms for vertex-partitioning problems on graphs with fixed clique-width

✍ Michael U. Gerber; Daniel Kobler 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Many vertex-partitioning problems can be expressed within a general framework introduced by Telle and Proskurowski. They showed that optimization problems in this framework can be solved in polynomial time on classes of graphs with bounded tree-width. In this paper, we consider a very similar framew

Tight complexity bounds for FPT subgraph

Tight complexity bounds for FPT subgraph problems parameterized by the clique-width

✍ Broersma, Hajo; Golovach, Petr A.; Patel, Viresh 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 591 KB