The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1669582 |
||
| Property / author | |||
| Property / author: Dmitriy S. Malyshev / rank | |||
Revision as of 07:22, 29 February 2024
scientific article; zbMATH DE number 6435298
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
