Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs (Q2840710)

From MaRDI portal
Revision as of 16:27, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs
scientific article

    Statements

    Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    \(k\)-tuple dominating set
    0 references
    \(k\)-limited packing
    0 references
    computational complexity
    0 references
    reductions
    0 references

    Identifiers