Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:06, 1 February 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
