An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-011-9533-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-011-9533-2 / rank | |||
Normal rank | |||
Latest revision as of 14:13, 18 December 2024
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
