On the algorithmic complexity of \(k\)-tuple total domination (Q400524)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the algorithmic complexity of \(k\)-tuple total domination
scientific article

    Statements

    On the algorithmic complexity of \(k\)-tuple total domination (English)
    0 references
    0 references
    0 references
    22 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-tuple total domination
    0 references
    total domination
    0 references
    block graph
    0 references
    cactus
    0 references
    algorithm
    0 references
    NP-complete
    0 references
    undirected path graph
    0 references
    0 references