✦ LIBER ✦

Clique-Width for 4-Vertex Forbidden Subgraphs

✍ Scribed by Andreas Brandstadt; Joost Engelfriet; Hoang-Oanh Le; Vadim V. Lozin

Publisher: Springer
Year: 2006
Tongue: English
Weight: 342 KB
Volume: 39
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-005-1199-1

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

A 3-Approximation Algorithm for Finding

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

✍ Yefim Dinitz; Zeev Nutov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 103 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ž . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Based on the paper of Auletta, Dinitz, Nutov, and Parente in this issue, Ä 4 we derive a 3-approximation algorithm for k g 4, 5 . This