✦ LIBER ✦

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

✍ Scribed by V. E. Alekseev; D. S. Malyshev

Book ID: 111471204
Publisher: Pleiades Publishing
Year: 2009
Tongue: English
Weight: 469 KB
Volume: 3
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478909010013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the maxim

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

The Exact Weighted Independent Set Probl

The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes

✍ Martin Milanič; Jérôme Monnot 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 191 KB

On easy and hard hereditary classes of g

On easy and hard hereditary classes of graphs with respect to the independent set problem

✍ Vladimir E. Alekseev 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 162 KB

In this paper we introduce the concept of a boundary class, which is a helpful tool for classiÿcation of hereditary classes of graphs according to the complexity of the independent set problem. It is shown that in a class X deÿned by a ÿnite set of forbidden induced subgraphs, the problem is NP-hard

Criterion for the unique solvability of

Criterion for the unique solvability of the cauchy problem in the class C∞for differential equations with a polynomial transformation of the argument

✍ B. M. Karelin 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 421 KB