Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithm and complexity of the two disjoint connected dominating sets problem on trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm and complexity of the two disjoint connected dominating sets problem on trees |
scientific article |
Statements
Algorithm and complexity of the two disjoint connected dominating sets problem on trees (English)
0 references
15 November 2019
0 references
connected dominating set
0 references
disjoint connected dominating sets
0 references
NP-hard
0 references
approximation algorithm
0 references
0 references
