๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Polynomial algorithms for the maximum st
โœ 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