Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs |
scientific article; zbMATH DE number 6286628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs |
scientific article; zbMATH DE number 6286628 |
Statements
Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (English)
0 references
17 April 2014
0 references
distributed self-stabilizing algorithms
0 references
graph algorithms
0 references
minimal total dominating set
0 references
minimal total \(k\)-domination
0 references
\(k\)-tuple total dominating set
0 references
0 references
0 references
0.8605955243110657
0 references
0.8548810482025146
0 references
0.8471916913986206
0 references
0.8380430936813354
0 references
