Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.2017.0776 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.2017.0776 / rank | |||
Normal rank | |||
Latest revision as of 16:03, 30 December 2024
scientific article; zbMATH DE number 7271634
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs |
scientific article; zbMATH DE number 7271634 |
Statements
Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (English)
0 references
9 November 2020
0 references
wireless sensor network
0 references
connected dominating set
0 references
fault tolerance
0 references
approximation algorithm
0 references
0 references
0 references
