On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On easy and hard hereditary classes of graphs with respect to the independent set problem |
scientific article; zbMATH DE number 2012949
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On easy and hard hereditary classes of graphs with respect to the independent set problem |
scientific article; zbMATH DE number 2012949 |
Statements
On easy and hard hereditary classes of graphs with respect to the independent set problem (English)
0 references
4 December 2003
0 references
Independent set problem
0 references
Hereditary class
0 references
Computational complexity
0 references
0 references
0.91027844
0 references
0.89648545
0 references
0.8943666
0 references
0.8943666
0 references
0.8918787
0 references
0.88796353
0 references
0.8876193
0 references
0.8873405
0 references
0.87703276
0 references
