Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977769214 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 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
