On the Algorithmic Complexity of Total Domination (Q3696538)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Algorithmic Complexity of Total Domination
scientific article

    Statements

    On the Algorithmic Complexity of Total Domination (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear time algorithm
    0 references
    minimum total dominating sets
    0 references
    tree
    0 references
    undirected path graphs
    0 references
    NP-complete
    0 references
    0 references