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; zbMATH DE number 7130487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm and complexity of the two disjoint connected dominating sets problem on trees |
scientific article; zbMATH DE number 7130487 |
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
0.8466924428939819
0 references
0.8208705186843872
0 references
0.8208705186843872
0 references
0.8183876872062683
0 references
0.8115553259849548
0 references
