The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6435298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem |
scientific article; zbMATH DE number 6435298 |
Statements
The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (English)
0 references
12 May 2015
0 references
independent number
0 references
\(H\)-packing number
0 references
0.8868099
0 references
0.8723416
0 references
0 references
0.86885417
0 references
0 references
0.8656024
0 references
0.8643836
0 references
0 references
0.8609648
0 references
