✦ LIBER ✦

Classes of subcubic planar graphs for which the independent set problem is polynomially solvable

✍ Scribed by Malyshev, D. S.

Book ID: 121598623
Publisher: Pleiades Publishing
Year: 2013
Tongue: English
Weight: 516 KB
Volume: 7
Category: Article
ISSN: 1990-4789
DOI: 10.1134/S199047891304008X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graph classes with the independen

Planar graph classes with the independent set problem solvable in polynomial time

✍ V. E. Alekseev; D. S. Malyshev 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 469 KB

Efficient computation of tolerances in t

Efficient computation of tolerances in the weighted independent set problem for some classes of graphs

✍ Malyshev, D. S.; Pardalos, P. M. 📂 Article 📅 2014 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 190 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