Solving connected dominating set faster than \(2^n\) (Q958203): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60488749, #quickstatements; #temporary_batch_1706974296281 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:45, 5 March 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
