✦ LIBER ✦

Robust Algorithms for the Stable Set Problem

✍ Scribed by Michael U. Gerber; Vadim V. Lozin

Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 320 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0517-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Algorithms for the Homogeneous Set Sandw

Algorithms for the Homogeneous Set Sandwich Problem

✍ Celina M.H. de Figueiredo; Guilherme D. da Fonseca; Vinicius G.P. de Sa; Jeremy 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 408 KB

On-line algorithms for the dominating se

On-line algorithms for the dominating set problem

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Implicit enumeration algorithms for the

Implicit enumeration algorithms for the Set-Partitioning Problem

✍ S. Albers 📂 Article 📅 1980 🏛 Springer 🌐 German ⚖ 797 KB

Polynomial algorithms for the maximum st

Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs

✍ Raffaele Mosca 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 588 KB

The Maximum Stable Set Problem (MS) is a well-known NP-hard problem. A popular research stream considers classes of graphs, defined in terms of forbidden subgraphs, in which either MS is NP-hard or can be solved by polynomial algorithms. In this paper we focus on three of these classes: in one of th