𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The stable set problem and the lift-and-project ranks of graphs

✍ Scribed by László Lipták; Levent Tunçel

Book ID
106275302
Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
329 KB
Volume
98
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stability critical graphs and ranks face
Stability critical graphs and ranks facets of the stable set polytope
✍ E.C. Sewell; L.E. Trotter Jr. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Rank inequalities due to stability critical (u-critical) graphs are used to develop a finite nested sequence of linear relaxations of the stable set polytope, the strongest of which provides an integral max-min relation: In a simple graph, the maximum size of a stable set is equal to the minimum (we

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