The Complexity of Perfect Packings in Dense Graphs (Q2988829): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_21 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2602033211 / rank | |||
Normal rank | |||
Revision as of 18:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Perfect Packings in Dense Graphs |
scientific article |
Statements
The Complexity of Perfect Packings in Dense Graphs (English)
0 references
19 May 2017
0 references
perfect packing
0 references
computational complexity
0 references
absorbing method
0 references
