Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2010.08.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2010.08.008 / rank | |||
Normal rank | |||
Revision as of 02:35, 11 December 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
0 references
0 references
