NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745)
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: NP-completeness of the \k \-packing function problem in graphs |
scientific article; zbMATH DE number 6639879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of the \(\{k \}\)-packing function problem in graphs |
scientific article; zbMATH DE number 6639879 |
Statements
NP-completeness of the \(\{k \}\)-packing function problem in graphs (English)
0 references
17 October 2016
0 references
set packing
0 references
dominating set
0 references
dually chordal graph
0 references
0 references
0.9394733309745787
0 references
0.8853198289871216
0 references
0.8655350208282471
0 references
0.8126099109649658
0 references
0.7758121490478516
0 references
