An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350)

From MaRDI portal
Revision as of 11:18, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
scientific article

    Statements

    An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    domination-type problems
    0 references
    moderately exponential time algorithms
    0 references
    NP-hardness results
    0 references
    measure and conquer
    0 references

    Identifiers