Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775): 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.ipl.2010.08.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046498514 / rank | |||
Normal rank | |||
Revision as of 23:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two algorithms for minimum 2-connected \(r\)-hop dominating set |
scientific article |
Statements
Two algorithms for minimum 2-connected \(r\)-hop dominating set (English)
0 references
3 November 2017
0 references
approximation algorithms
0 references
wireless sensor network
0 references
\(r\)-hop dominating set
0 references
fault-tolerant
0 references
unit disk graph
0 references
