Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs (Q2835672)
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: Towards a polynomial equivalence between \k\-packing functions and k-limited packings in graphs |
scientific article; zbMATH DE number 6657806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs |
scientific article; zbMATH DE number 6657806 |
Statements
Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (English)
0 references
30 November 2016
0 references
computational complexity
0 references
F-free graph
0 references
bipartite graph
0 references
0 references
0.8885879516601562
0 references
0.8853198289871216
0 references
0.8528764247894287
0 references
0.825868546962738
0 references
