Solving connected dominating set faster than \(2^n\) (Q958203): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-007-9145-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-007-9145-Z / rank | |||
Normal rank | |||
Latest revision as of 09:59, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving connected dominating set faster than \(2^n\) |
scientific article |
Statements
Solving connected dominating set faster than \(2^n\) (English)
0 references
2 December 2008
0 references
exponential-time exact algorithm
0 references
NP-hard problem
0 references
connected dominating set
0 references
maximum leaf spanning tree
0 references
