✦ LIBER ✦

Handelman’s hierarchy for the maximum stable set problem

✍ Scribed by Laurent, Monique; Sun, Zhao

Book ID: 121595541
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 474 KB
Volume: 60
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-013-0123-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomially solvable cases for the maxi

Polynomially solvable cases for the maximum stable set problem

✍ Alain Hertz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 916 KB

An exact algorithm for the maximum stabl

An exact algorithm for the maximum stable set problem

✍ Carlo Mannino; Antonio Sassano 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 795 KB

The struction algorithm for the maximum

The struction algorithm for the maximum stable set problem revisited

✍ K.W. Hoke; M.F. Troyon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 491 KB

An Augmentation Algorithm for the Maximu

An Augmentation Algorithm for the Maximum Weighted Stable Set Problem

✍ Carlo Mannino; Egidio Stefanutti 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 84 KB

A Branch and Cut solver for the maximum

A Branch and Cut solver for the maximum stable set problem

✍ Steffen Rebennack; Marcus Oswald; Dirk Oliver Theis; Hanna Seitz; Gerhard Reinel 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 836 KB

P5-free augmenting graphs and the maximu

P5-free augmenting graphs and the maximum stable set problem

✍ Michael U. Gerber; Alain Hertz; David Schindl 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 174 KB

The complexity status of the maximum stable set problem in the class of P5-free graphs is unknown. In this paper, we ÿrst propose a characterization of all connected P5-free augmenting graphs. We then use this characterization to detect families of subclasses of P5-free graphs where the maximum stab