An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
scientific article

    Statements

    An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (English)
    0 references
    0 references
    0 references
    18 May 2016
    0 references
    dominating set
    0 references
    fixed-parameter tractability
    0 references
    tree decomposition
    0 references
    computational complexity
    0 references

    Identifiers

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