Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:17, 8 February 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
