An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} |
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
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
