Solving connected dominating set faster than \(2^n\) (Q958203)
From MaRDI portal
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
