Minimum connected dominating sets in finite graphs (Q712285)
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: Minimum connected dominating sets in finite graphs |
scientific article; zbMATH DE number 5807526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum connected dominating sets in finite graphs |
scientific article; zbMATH DE number 5807526 |
Statements
Minimum connected dominating sets in finite graphs (English)
0 references
28 October 2010
0 references
dominating set
0 references
greedy algorithm
0 references
performance ratio
0 references
0.8640763163566589
0 references
0.8637694120407104
0 references
0.8637694120407104
0 references
0.8597862124443054
0 references
0.8530874252319336
0 references
