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
Removed claim: author (P16): Item:Q1669582 |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1515/dma-2013-017 / rank | |||
| Property / author | |||
| Property / author: Dmitriy S. Malyshev / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/dma-2013-017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2331396760 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/DMA-2013-017 / rank | |||
Normal rank | |||
Latest revision as of 16:31, 30 December 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
