NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745)

From MaRDI portal
Revision as of 18:33, 12 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
NP-completeness of the \(\{k \}\)-packing function problem in graphs
scientific article

    Statements

    NP-completeness of the \(\{k \}\)-packing function problem in graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2016
    0 references
    set packing
    0 references
    dominating set
    0 references
    dually chordal graph
    0 references

    Identifiers