Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173)
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: Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs |
scientific article; zbMATH DE number 5602741
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs |
scientific article; zbMATH DE number 5602741 |
Statements
Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (English)
0 references
10 September 2009
0 references
connected dominating set
0 references
wireless networks
0 references
fault tolerance
0 references
Chernoff inequality
0 references
0 references
0.90776694
0 references
0.8860055
0 references
0.8856329
0 references
0 references
0.87915444
0 references
0.87915444
0 references
0.8771163
0 references
0.8768628
0 references
