On the parameterized complexity of \([1,j]\)-domination problems (Q2283043)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the parameterized complexity of \([1,j]\)-domination problems
scientific article

    Statements

    On the parameterized complexity of \([1,j]\)-domination problems (English)
    0 references
    0 references
    0 references
    0 references
    27 December 2019
    0 references
    \([1, j]\)-dominating set
    0 references
    total dominating set
    0 references
    restrained dominating set
    0 references
    parameterized complexity
    0 references
    sparse graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references