Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:59, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs |
scientific article |
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
