Solving connected dominating set faster than \(2^n\) (Q958203)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5377139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving connected dominating set faster than \(2^n\) |
scientific article; zbMATH DE number 5377139 |
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
0.9989068508148192
0 references
0.8408712148666382
0 references
0.8372766375541687
0 references
0.8372766375541687
0 references
0.835204005241394
0 references
