The complexity of perfect packings in dense graphs (Q2988829)
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: The complexity of perfect packings in dense graphs |
scientific article; zbMATH DE number 6721525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of perfect packings in dense graphs |
scientific article; zbMATH DE number 6721525 |
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
0 references
0.8952101469039917
0 references
0.8940284252166748
0 references
0.8459855318069458
0 references
0.8457838892936707
0 references
