An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 07:09, 5 March 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
