Polynomial reductions between the limited packing and tuple domination problems in graphs (Q2840710)
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: Polynomial reductions between the limited packing and tuple domination problems in graphs |
scientific article; zbMATH DE number 6190244
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial reductions between the limited packing and tuple domination problems in graphs |
scientific article; zbMATH DE number 6190244 |
Statements
23 July 2013
0 references
\(k\)-tuple dominating set
0 references
\(k\)-limited packing
0 references
computational complexity
0 references
reductions
0 references
0 references
0.9520545
0 references
0.90984887
0 references
0.9033598
0 references
0.9024213
0 references
0.8804687
0 references
0.8777659
0 references
0 references
0 references
Polynomial reductions between the limited packing and tuple domination problems in graphs (English)
0 references
