An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-011-9533-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977068662 / rank | |||
Normal rank | |||
Revision as of 21:25, 19 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
