On easy and hard hereditary classes of g
β
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